A spatial logic for concurrency (Part II)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2421 LNCS, Issue , 2002, Pages 209-225

  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

DISTRIBUTED SYSTEMS; FRESH QUANTIFIER; MODAL LOGIC; PROCESS COMPOSITIONS; SPATIAL LOGIC; SPATIAL OPERATIONS; SPATIAL ORGANIZATION; TEMPORAL OPERATORS;

COMPUTER CIRCUITS;

RECONFIGURABLE HARDWARE;

EID: 35248827089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_15     Document Type: Conference Paper

References (18)

1. 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.
2. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). In N. Kobayashi and B. C. Pierce, editors, Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (TACS 2001), volume 2215 of Lecture Notes in Computer Science, pages 1-30. Springer-Verlag, 2001.
3. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part II). Technical Report 3/2002/DI/PLM/FCTUNL, DI/PLM FCT Universidade Nova de Lisboa, 2002.
4. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). Information and Computation, to appear.
5. π. In C. Hankin, editor, Programming Languages and Systems: Proceedings of the 7th European Symp. on Programming (ESOP 1998), number 1381 in Lecture Notes in Computer Science, pages 42-56. Springer-Verlag, 1998.
6. C. Calcagno, Luca Cardelli, and Andrew Gordon. Deciding Validity in a Spatial Logic of Trees. to appear, 2002.
7. L. Cardelli and A. D. Gordon. Anytime, Anywhere. Modal Logics for Mobile Ambients. In 27th ACM Symp. on Principles of Programming Languages, pages 365-377. ACM, 2000.
8. L. Cardelli and A. D. Gordon. Logical Properties of Name Restriction. In S. Abramsky, editor, Typed Lambda Calculi and Applications, number 2044 in Lecture Notes in Computer Science. Springer-Verlag, 2001.
9. M. Dam. Relevance Logic and Concurrent Composition. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 178-185, Edinburgh, Scotland, 5-8 July 1988. IEEE Computer Society.
10. M. Gabbay and A. Pitts. A New Approach to Abstract Syntax Involving Binders. In 14th Annual Symposium on Logic in Computer Science, pages 214-224. IEEE Computer Society Press, Washington, 1999.
11. M. Hennessy and R. Milner. Algebraic laws for Nondeterminism and Concurrency. JACM, 32(1):137-161, 1985.
12. P. O'Hearn and D. Pym. The Logic of Bunched Implications. The Bulletin of Symbolic Logic, 5(2):215-243, 1999.
13. A. Pitts. Nominal Logic: A First Order Theory of Names and Binding. In B. C. Pierce N. Kobayashi, editor, Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science (TACS 2001), volume 2215 of Lecture Notes in Computer Science, pages 219-235. Springer-Verlag, 2001.
14. G. Plotkin and M. Abadi. A logic for parametric polymorphism. In M. Bezem and J. F. Groote, editors, International Conference on Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, pages 361-375, Utrecht, The Netherlands, March 1993. Springer-Verlag. TLCA'93.
15. J. C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In Proceedings of the Third Annual Symposium on Logic in Computer Science, Copenhagen, Denmark, 2002. IEEE Computer Society.
16. D. Sangiorgi. Extensionality and Intensionality of the Ambient Logics. In 28th Annual Symposium on Principles of Programming Languages, pages 4-13. ACM, 2001.
17. A. Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. Ph.D. thesis, Dept. of Computer Science, Edingburgh University, 1994.
18. Luca Viganò. Label l ed Non-Classical Logics. Kluwer Academic Publishers, Dordrecht, 2000.