Skip to main content
SpringerLink
Log in

A Spatial Logic for Concurrency (Part II)

  • Conference paper
  • First Online:
CONCUR 2002 — Concurrency Theory (CONCUR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2421))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). Information and Computation, to appear.

    Google Scholar 

  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. C. Calcagno, Luca Cardelli, and Andrew Gordon. Deciding Validity in a Spatial Logic of Trees. to appear, 2002.

    Google Scholar 

  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. 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.

    Chapter  Google Scholar 

  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. 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. M. Hennessy and R. Milner. Algebraic laws for Nondeterminism and Concurrency. JACM, 32(1):137–161, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. O’Hearn and D. Pym. The Logic of Bunched Implications. The Bulletin of Symbolic Logic, 5(2):215–243, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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. D. Sangiorgi. Extensionality and Intensionality of the Ambient Logics. In 28th Annual Symposium on Principles of Programming Languages, pages 4–13. ACM, 2001. 212, 222

    Google Scholar 

  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. Luca Viganò. Labelled Non-Classical Logics. Kluwer Academic Publishers, Dordrecht, 2000.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, FCT/UNL, Lisboa, Portugal

    Luís Caires

  2. Microsoft Research, Cambridge, UK

    Luca Cardelli

Authors
  1. Luís Caires
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Cardelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caires, L., Cardelli, L. (2002). A Spatial Logic for Concurrency (Part II). In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44043-7

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation