Advertisement

A Spatial Logic for Concurrency (Part II)

  • Luís Caires
  • Luca Cardelli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2421)

Abstract

We present a modal logic for describing the spatial organization and the behavior of distributed systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to process composition and name hiding, and a fresh quantifier.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 4.
    L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). Information and Computation, to appear.Google Scholar
  5. 5.
    L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in Lπ. 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.Google Scholar
  6. 6.
    C. Calcagno, Luca Cardelli, and Andrew Gordon. Deciding Validity in a Spatial Logic of Trees. to appear, 2002.Google Scholar
  7. 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.Google Scholar
  8. 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.CrossRefGoogle Scholar
  9. 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.Google Scholar
  10. 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.Google Scholar
  11. 11.
    M. Hennessy and R. Milner. Algebraic laws for Nondeterminism and Concurrency. JACM, 32(1):137–161, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    P. O’Hearn and D. Pym. The Logic of Bunched Implications. The Bulletin of Symbolic Logic, 5(2):215–243, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 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.Google Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar
  16. 16.
    D. Sangiorgi. Extensionality and Intensionality of the Ambient Logics. In 28th Annual Symposium on Principles of Programming Languages, pages 4–13. ACM, 2001. 212, 222Google Scholar
  17. 17.
    A. Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. Ph.D. thesis, Dept. of Computer Science, Edingburgh University, 1994.Google Scholar
  18. 18.
    Luca Viganò. Labelled Non-Classical Logics. Kluwer Academic Publishers, Dordrecht, 2000.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Luís Caires
    • 1
  • Luca Cardelli
    • 2
  1. 1.Departamento de InformáticaFCT/UNLLisboaPortugal
  2. 2.Microsoft ResearchCambridgeUK

Personalised recommendations