Behavioral and spatial observations in a logic for the π-calculus

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

Volumn 2987, Issue , 2004, Pages 72-89

  Caires, Luís ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; MODEL CHECKING; RECONFIGURABLE HARDWARE;

BEHAVIORAL PROPERTIES; CONCURRENT SYSTEMS; FINITE CONTROL; PI CALCULUS; SPATIAL LOGIC; SPATIAL OBSERVATION; STRONG BISIMULATION; STRUCTURAL CONGRUENCES;

CALCULATIONS;

EID: 35048869191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_7     Document Type: Article

References (25)

1. R. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
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 and L. Cardelli. A Spatial Logic for Concurrency (Part II). In CONCUR 2002 (13th International Conference), Lecture Notes in Computer Science. Springer-Verlag, 2002.
4. L. Caires and L. Cardelli. A Spatial Logic for Concurrency (Part I). Information and Computation, 186(2):194-235, 2003.
5. L. Cardelli, P. Gardner, and G. Ghelli. Manipulating Trees with Hidden Labels. In A. D. Gordon, editor, Proc. of Foundations of Software Science and Computation Structures (FoSSaCS '03), Lecture Notes in Computer Science. Springer-Verlag, 2003.
6. 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.
7. 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.
8. VV. Charatonik, A. D. Gordon, and J.-M. Talbot. Finite-control mobile ambients. In D. Metayer, editor, 11th European Symposium on Programming (ESOP 2002), number 2305 in Lecture Notes in Computer Science. Springer-Verlag, 2002.
9. W. Charatonik and J.-M. Talbot. The decidability of model-checking mobile ambients. In D. Metayer, editor, 11th European Symposium on Programming (ESOP 2002), number 2305 in Lecture Notes in Computer Science. Springer-Verlag, 2001. 10. S. Dal-Zilio. Spatial Congruence for Ambients is Decidable. In 6th ACS Conference, number 1961 in Lecture Notes in Computer Science, pages 365-377. SpringerVerlag, 2000.
10. M. Dam. Model checking mobile processes. Information and Computation, 129(1):35-51, 1996.
11. 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.
12. J. Engelfriet and T. Gelsema. Multisets and Structural Congruence of the πcalculus with Replication. Theoretical Computer Science, (211):311-337, 1999.
13. M. Gabbay and A. Pitts. A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing, 13(3-5):341-363, 2002.
14. G. Ghelli and G. Conforti. Decidability of freshness, undecidability of revelation. Technical Report 03-11, Dipartimento di Informatica, Universita di Pisa, 2003.
15. D. Hirschkoff, E. Lozes, and D. Sangiorgi. Separability, Expressiveness and Decidability in the Ambient Logic. In Proc. LICS, Copenhagen, Denmark, 2002. IEEE Computer Society.
16. D. Hirschkoff, E. Lozes, and D. Sangiorgi. Minimality results for the spatial logics. In Proc. of FSTTCS'2003, number 2914 in Lecture Notes in Computer Science. Springer Verlag, 2003.
17. S. Ishtiaq and P. O'Hearn. BI as an Assertion Language for Mutable Data Structures. In 28th ACM Symp. on Principles of Programming Languages, 2001.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
19. R. Milner. Communicating and Mobile Systems: the π-calculus. CUP, 1999.
20. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114:149-171, 1993.
21. U. Montanari and M. Pistore. Pi-Calculus, Structured Coalgebras, and Minimal HD-Automata. In MFCS: Symp. on Mathematical Foundations of Computer Science, pages 569-578, 2000.
22. P. O'Hearn and D. Pym. The Logic of Bunched Implications. The Bulletin of Symbolic Logic, 5(2):215-243, 1999.
23. D. Sangiorgi. Extensionality and Intensionality of the Ambient Logics. In 28th Annual Symposium on Principles of Programming Languages, pages 4-13. ACM, 2001.
24. D. Sangiorgi and D. Walker. The π-calculus: A Theory of Mobile Processes. CUP, 2001.
25. G. Winskel. A note on model checking the modal ν-calculus. In G. Ausiello, M. Dezani-Ciancaglini, and S. R. D. Rocca, editors, (ICALP 1989), volume 372 of Lecture Notes in Computer Science, pages 761-772. Springer-Verlag, 1989.