On bisimulations for the asynchronous ?-calculus, Theoretical Computer Science, vol.195, pp.291-324, 1998. ,
DOI : 10.1007/3-540-61604-7_53
URL : https://hal.archives-ouvertes.fr/inria-00073784
When ambients cannot be opened, THE AMBIENT LOGIC * 43, vol.333, pp.127-169, 2005. ,
DOI : 10.1016/j.tcs.2004.10.020
URL : https://hal.archives-ouvertes.fr/inria-00536689
On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, vol.322, issue.3, pp.477-515, 2004. ,
Deciding Reachability in Mobile Ambients, Proc. of European Symposium on Programming, vol.3444, pp.248-262, 2005. ,
DOI : 10.1007/978-3-540-31987-0_18
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-31987-0_18.pdf
Behavioral and Spatial Observations in a Logic for the pi-Calculus, Proc. of FOSSACS'04, vol.2987, pp.72-89, 2004. ,
DOI : 10.1007/978-3-540-24727-2_7
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-24727-2_7.pdf
Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency, Proc. of CONCUR'04, vol.3170, pp.240-257, 2004. ,
Extensionality of Spatial Observations in Distributed Systems, Electr. Notes Theor. Comput. Sci, vol.175, issue.3, pp.131-149, 2007. ,
Deciding Validity in a Spatial Logic for Trees, Proc. of TLDI'03, pp.62-73, 2003. ,
Describing Semistructured Data. SIGMOD Record, Database Principles Column, vol.30, 2001. ,
A Query Language Based on the Ambient Logic, Proc. of ESOP'01, vol.2028, pp.1-22, 2001. ,
Anytime, Anywhere, Modal Logics for Mobile Ambients, Proc. of POPL'00, pp.365-377, 2000. ,
Logical Properties of Name Restriction, Proc. of TLCA'01, vol.2044, 2001. ,
Mobile ambients, Proc. FoSSaCS '98, vol.1378, pp.140-155, 1998. ,
Anytime, anywhere: Modal logics for mobile ambients, Proc. 27th POPL, 2000. ,
Relevance Logic and Concurrent Composition, Proc. of LICS'88, pp.178-185, 1988. ,
Adjunct elimination through games in Static Ambient Logic, Proc. of the 24th Foundations of Software Technology and Theoretical Computer Science (FSTTCS), vol.3328, pp.211-223, 2004. ,
A New Approach to Abstract Syntax with Variable Binding, Formal Aspects of Computing, vol.13, issue.3-5, pp.341-363, 2002. ,
Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, pp.137-161, 1985. ,
An Extensional Spatial Logic for Mobile Processes, Proc. of CONCUR'04, vol.3170, pp.325-339, 2004. ,
Expressiveness and Decidability in the Ambient Logic, 17th IEEE Symposium on Logic in Computer Science, pp.423-432, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-02101816
On the expressiveness of the ambient logic, Logical Methods in Computer Science, vol.2, issue.2, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00009279
A distribution law for ccs and a new congruence result for the pi-calculus, Proc. of FoSSaCS'07, vol.4423, pp.228-242, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00089219
Proving congruence of bisimulation in functional programming languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996. ,
Controlling interference in ambients. Short version appeared in, Proc. 27th POPL, 2000. ,
Mobile Safe Ambients, Short version appeared in Proc. 27th POPL, vol.25, pp.1-69, 2003. ,
Elimination of spatial connectives in static spatial logics, Theoretical Computer Science, vol.330, issue.3, pp.475-499, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-01905204
On the Computational Strength of Pure Ambient Calculi, Theoretical Computer Science, vol.330, issue.3, pp.501-551, 2005. ,
Communicating and Mobile Systems: the ?-Calculus, 1999. ,
Barbed bisimulation, Proc. 19th ICALP, vol.623, pp.685-695, 1992. ,
DOI : 10.1007/3-540-55719-9_114
,
Extensionality and Intensionality of the Ambient Logic, Proc. of 28th POPL, pp.4-17, 2001. ,
DOI : 10.1145/360204.375707
The ?-calculus: a Theory of Mobile Processes, 2001. ,
Structural Congruence for Ambients is Decidable, Proc. of ASIAN'00, vol.1961, 2000. ,