A spatial logic for concurrency (part I)

Information and Computation

Volumn 186, Issue 2, 2003, Pages 194-235

  Caires, Luís ^a   Cardelli, Luca ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; CONCURRENT ENGINEERING; FORMAL LOGIC; MATHEMATICAL OPERATORS;

TEMPORAL OPERATORS;

INFORMATION SCIENCE;

EID: 0142121530     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00137-8     Document Type: Conference Paper

References (33)

1. G. Boudol. Asynchrony and the π-calculus (note), Rapport de Recherche 1702, INRIA Sofia-Antipolis, May 1992.
2. L. Caires, A model for declarative programming and specification with concurrency and mobility, PhD thesis, Dept. de Informática, FCT, Universidade Nova de Lisboa, 1999.
3. L. Caires. A specification logic for mobility, Technical Report 4, Dept. de Informática, FCT, Universidade Nova de Lisboa, 2000.
4. L. Caires, L. Cardelli, A spatial logic for concurrency (Part I), in: N. Kobayashi, B.C. Pierce (Eds.), Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (TACS 2001), Lecture Notes in Computer Science, vol. 2215, Springer-Verlag, 2001, pp. 1-30.
5. L. Caires, L. Cardelli, A spatial logic for concurrency (Part II), in: CONCUR 2002: Concurrency Theory (13th International Conference), Lecture Notes in Computer Science, Springer-Verlag, 2002.
6. π, in: C. Hankin (Ed.), Programming Languages and Systems: Proceedings of the 7th European Symp. on Programming (ESOP 1998), Lecture Notes in Computer Science, vol. 1381, Springer-Verlag, 1998, pp. 42-56.
7. C. Calcagno, Luca Cardelli, Andrew Gordon, deciding validity in a spatial logic of trees, ACM Workshop on Types in Language Design and Implementation, TLDI'03, New Orleans, January 2003, ACM Press, pp. 62-73.
8. L. Cardelli, P. Gardner, G. Ghelli, A spatial logic for querying graphs, in: 29th Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer-Verlag, 2002.
9. L. Cardelli, G. Ghelli, A query language based on the ambient logic, in: David Sands (Ed.), Programming Languages and Systems: Proceedings of the 10th European Symposium on Programming (ESOP 2001), Lecture Notes in Computer Science, vol. 2028, Springer-Verlag, 2001, pp. 1-22.
10. L. Cardelli, A.D. Gordon, Anytime, anywhere. Modal logics for mobile ambients, in: 27th ACM Symposium on Principles of Programming Languages, ACM, 2000, pp. 365-377.
11. L. Cardelli, A.D. Gordon, Logical properties of name restriction, in: S. Abramsky (Ed.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 2044, Springer-Verlag, 2001.
12. W. Charatonik, J.-M. Talbot. The decidability of model checking mobile ambients. In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science, Springer-Verlag, 2001, to appear.
13. S. Dal-Zilio, Spatial congruence for ambients is decidable, in: Proceedings of ASIAN'00-6th Asian Computing Science Conference, Lecture Notes in Computer Science, vol. 1961, Springer-verlag, 2000, pp. 365-377.
14. M. Dam, Relevance logic and concurrent composition, in: Proceedings, Third Annual Symposium on Logic in Computer Science, IEEE Computer Society, Edinburgh, Scotland, 1988, pp. 178-185.
15. M. Dam, Relevance logic and concurrent composition, PhD thesis, University of Edinburgh, 1989.
16. M. Dam, Model checking mobile processes, Information and Computation 129 (1) (1996) 35-51.
17. M. Dam, Proof systems for π-calculus logics, in: de Queiroz, editor, Logic for Concurrency and Synchronisation, Studies in Logic and Computation. Oxford University Press, to appear.
18. J. Engelfriet, Tj. Gelsema, Multisets and structural congruence of the π-calculus with replication, Theoretical Computer Science 211 (1999) 311-337.
19. M. Gabbay, A. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing, 13 (2002) 341-363.
20. M. Gabbay, A. Pitts, A new approach to abstract syntax involving binders, in: 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington, 1999, pp. 214-224.
21. P. Gardner, From process calculi to process frameworks, in: Catuscia Palamidessi (Ed.), CONCUR 2000: Concurrency Theory (11th International Conference, University Park, PA, USA), Lecture Notes in Computer Science, vol. 1877, Springer, 2000, pp. 69-88.
22. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, JACM 32 (1) (1985) 137-161.
23. D. Hirschkoff, E. Lozes, D. Sangiorgi, Separability, expressiveness and decidability in the Ambient Logic, in: Proceedings of the Third Annual Symposium on Logic in Computer Science, IEEE Computer Society, Copenhagen, Denmark, 2002.
24. K. Honda, M. Tokoro, On asynchronous communication semantics, in: M. Tokoro, O. Nierstrasz, P. Wegner (Eds.), Object-Based Concurrent Computing 1991, Lecture Notes in Computer Science, vol. 612, Springer-Verlag, 1992, pp. 21-51.
25. D. Kozen, Results on the prepositional μ-calculus, Theoretical Computer Science 27 (3) (1983) 333-354.
26. R. Milner, Functions as processes, Mathematical Structure in Computer Sciences 2 (2) (1992) 119-141.
27. R. Milner, Communicating and Mobile Systems: The π-Calculus, Cambridge University Press, 1999.
28. R. Milner, Bigraphical reactive systems: basic theory. Technical Report 523, Cambridge Computer Laboratory, 2002.
29. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoretical Computer Science 114 (1993) 149-171.
30. P. O'Hearn, D. Pym, The logic of bunched implications, The Bulletin of Symbolic Logic 5 (2) (1999) 215-243.
31. A. Pitts, Nominal logic: a first order theory of names and binding, in: B.C. Pierce, N. Kobayashi (Eds.), Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (TACS 2001), Lecture Notes in Computer Science, vol. 2215, Springer-Verlag, 2001, pp. 219-235.
32. J.C. Reynolds, Separation logic: a logic for shared mutable data structures, in: Proceedings of the Third Annual Symposium on Logic in Computer Science, IEEE Computer Society, Copenhagen, Denmark, 2002.
33. D. Sangiorgi, Extensionality and intensionality of the Ambient Logics, in: 28th Annual Symposium on Principles of Programming Languages, ACM, 2001, pp. 4-13.