, each time and at each call to shift ,X , ??? will imply shift s 0 ,X ??shift s 0 ,X ?. We actually have the following stronger result
, Lemma 8.2 For all assertion P ? SL with v(P) ? X, ? | = P iff shift s 0 ,X ? | = P
A Spatial Logic for Concurrency (Part I), Proc. of TACS'01, 2001. ,
Computability and Complexity Results for a Spatial Assertion Language for Data Structures, Proceedings of FSTTCS '01, vol.2245, 2001. ,
Manipulating trees with hidden labels, Foundations of Software Science and Computational Structures, 6th International Conference, vol.2620, pp.216-232, 2003. ,
A Query Language Based on the Ambient Logic, Proc. of ESOP'01, vol.2028, pp.1-22, 2001. ,
Mobile Ambients, Proc. of FOSSACS'98, vol.1378, pp.140-155, 1998. ,
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. ,
Deciding Validity in a Spatial Logic for Trees, Proc. of TLDI'03, pp.62-73, 2003. ,
The Decidability of Model Checking Mobile Ambients, Proc. of CSL'01, 2001. ,
A new approach to abstract syntax involving binders, 14th Annual Symposium on Logic in Computer Science, pp.214-224, 1999. ,
DOI : 10.1109/lics.1999.782617
Decidability of freshness, undecidability of revelation, Procs. of FOSSACS'04, 2004. ,
Expressiveness and Decidability in the Ambients Logic, 17th IEEE Symposium on Logic in Computer Science, pp.423-432, 2002. ,
DOI : 10.1109/lics.2002.1029850
An axiomatic basis for computer programming, Communications of the ACM, pages, vol.12, issue.10, pp.576-580, 1969. ,
DOI : 10.1145/357980.358001
Intuitionistic reasoning about shared mutable data structure, 2000. ,
Separation logic: a logic for shared mutable data structures-invited paper, Proceedings of LICS '02, 2002. ,
A Logic You Can Count On, Proc. of POPL'04, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00071562
Extensionality and Intensionality of the Ambient Logic, Proc. of 28th POPL, pp.4-17, 2001. ,
Local Reasoning for Stateful programs, 2001. ,