Psi-calculi: A framework for mobile processes with nominal data and logic

Logical Methods in Computer Science

Volumn 7, Issue 1, 2011, Pages

  Bengtson, Jesper ^a   Johansson, Magnus ^a   Parrow, Joachim ^a   Victor, Björn ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Bisimulation; Nominal sets; Operational semantics; Pi calculus; Theorem prover

Indexed keywords

BIOMINERALIZATION; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DIFFERENTIATION (CALCULUS); PATHOLOGY; PATTERN MATCHING; SEMANTICS; THEOREM PROVING;

BISIMULATIONS; NOMINAL SETS; OPERATIONAL SEMANTICS; PI CALCULUS; THEOREM PROVERS;

CALCULATIONS;

EID: 79955434498     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(1:11)2011     Document Type: Article

References (40)

1. Martín Abadi and Cédric Fournet. Mobile values, new names, and secure communication. In Proceedings of POPL '01, pages 104-115. ACM, January 2001.
2. Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The Spi calculus. Journal of Information and Computation, 148(1):1-70, 1999.
3. Clemens Ballarin. Locales and locale expressions in Isabelle/Isar. In Types for Proofs and Pro-grams, volume 3085 of Lecture Notes in Computer Science, pages 34-50. Springer, 2003.
4. Jesper Bengtson. Formalising Process Calculi. PhD thesis, Uppsala University, June 2010.
5. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. Psi-calculi: Mobile processes, nominal data, and logic. In Proceedings of LICS 2009, pages 39-48. IEEE Computer Society, 2009.
6. Maria Grazia Buscemi and Ugo Montanari. CC-Pi: A constraint-based language for specifying service level agreements. In Rocco De Nicola, editor, Proceedings of ESOP 2007, volume 4421 of Lecture Notes in Computer Science, pages 18-32. Springer, 2007.
7. Maria Grazia Buscemi and Ugo Montanari. Open bisimulation for the concurrent constraint picalculus. In Sophia Drossopoulou, editor, Proceedings of ESOP 2008, volume 4960 of Lecture Notes in Computer Science, pages 254-268. Springer, 2008.
8. Maria Grazia Buscemi and Ugo Montanari. Open bisimulation for the concurrent constraint picalculus: Errata corrige. Available from http://www.di.unipi.it/~buscemi/Errata.pdf, January 2009.
9. Johannes Borgström and Uwe Nestmann. On bisimulations for the spi calculus. Mathematical Structures in Computer Science, 15(03):487-552, 2005.
10. Jesper Bengtson and Joachim Parrow. Formalising the pi-calculus using nominal logic. In Pro- ceedings of FoSSaCS 2007, volume 4423 of Lecture Notes in Computer Science, pages 63-77. Springer, 2007.
11. Jesper Bengtson and Joachim Parrow. Psi-calculi in Isabelle. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Proceedings of TPHOLs 2009, volume 5674 of Lecture Notes in Computer Science, pages 99-114. Springer, August 2009.
12. Maria Grazia Buscemi. Personal communication, January 2009.
13. Marco Carbone and Sergio Maffeis. On the expressive power of polyadic synchronisation in l{cyrillic}- calculus. Nordic Journal of Computing, 10(2):70-98, 2003.
14. Véronique Cortier, Michael Rusinowitch, and Eugen Zalinescu. Relating two standard notions of secrecy. Logical Methods in Computer Science, 3(3), 2007.
15. Tom Chothia and Ian Stark. A distributed calculus with local areas of communication. In HLCL '00: Proceedings of the 4th International Workshop on High-Level Concurrent Languages, volume 41.2 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
16. Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
17. Stéhanie Delaune, Steve Kremer, and Mark D. Ryan. Symbolic bisimulation for the applied pi-calculus. In V. Arvind and Sanjiva Prasad, editors, Proceedings of FSTTCS'07, volume 4855 of Lecture Notes in Computer Science, pages 133-145. Springer, December 2007.
18. Juan F. Diaz, Camilo Rueda, and Frank D. Valencia. Pi+-calculus: A calculus for concurrent processes with constraints. CLEI Electronic Journal, 1(2), 1998. Proceedings of CLEI'97, Valparaiso, Chile.
19. Yuxi Fu. A proof-theoretical approach to communication. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Proceedings of ICALP '97, volume 1256 of Lecture Notes in Computer Science, pages 325-335. Springer, 1997.
20. J. Goubault-Larrecq, C. Palamidessi, and A. Troina. A probabilistic applied pi-calculus. In Proceedings of APLAS'07, volume 4807 of Lecture Notes in Computer Science, pages 175-190. Springer, 2007.
21. Jens Christian Godskesen. Observables for mobile and wireless broadcasting systems. In Proc. of COORDINATION 2010, volume 6116 of Lecture Notes in Computer Science, pages 1-15. Springer, 2010.
22. Murdoch Gabbay and Andrew Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
23. Philippa Gardner and Lucian Wischik. Explicit fusions. In Mogens Nielsen and Branislav Rovan, editors, Proceedings of MFCS 2000, volume 1893 of Lecture Notes in Computer Science, pages 373-382. Springer, 2000.
24. Magnus Johansson, Jesper Bengtson, Joachim Parrow, and Björn Victor. Weak equivalences in psi-calculi. In Proceedings of LICS 2010. IEEE Computer Society, July 2010.
25. Magnus Johansson. Psi-calculi: a Framework for Mobile Process Calculi. PhD thesis, Uppsala University, May 2010.
26. Magnus Johansson, Joachim Parrow, Björn Victor, and Jesper Bengtson. Extended pi-calculi. In Luca Aceto, Ivan Damg°ard, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Proceedings of ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pages 87-98. Springer, July 2008.
27. Magnus Johansson, Björn Victor, and Joachim Parrow. A fully abstract symbolic semantics for psi-calculi. In Proceedings of the 6th Workshop on Structural Operational Semantics: SOS 2009, volume 18 of Electronic Proceedings in Theoretical Computer Science, pages 17-31, 2010.
28. Steve Kremer and Mark D. Ryan. Analysis of an electronic voting protocol in the applied picalculus. In Mooly Sagiv, editor, Proceedings of ESOP'05, volume 3444 of Lecture Notes in Com-puter Science, pages 186-200. Springer, April 2005.
29. H.K. Markey and G. Antheil. Secret communication system. United States Patent 2,292,387, 1942.
30. Massimo Merro. On the expressiveness of chi, update, and fusion calculi. In Catuscia Palamidessi and Ilaria Castellani, editors, Proceedings of EXPRESS '98, volume 16.2 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 1998.
31. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part I/II. Journal of Information and Computation, 100:1-77, September 1992.
32. Joachim Niehren and Martin Müller. Constraints for free in concurrent computation. In Kanchana Kanchanasut and Jean-Jacques Lévy, editors, Asian Computer Science Conference, volume 1023 of Lecture Notes in Computer Science, pages 171-186, Pathumthani, Thailand, 11-13 December 1995. Springer.
33. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: a Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002.
34. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Compu- tation, 186:165-193, 2003.
35. Joachim Parrow and Björn Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS '98, pages 176-185. IEEE, Computer Society Press, July 1998.
36. Vijay A. Saraswat. Concurrent Constraint Programming. ACM Doctoral Dissertation Award. MIT Press, Cambridge, Massachusetts, 1993.
37. Gert Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Proceedings 1st International Conference of Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 50-72. Springer, 1994. Available as Research Report RR-94-16 from DFKI Kaiserslautern.
38. Christian Urban. Nominal techniques in Isabelle/HOL. Journal of Automated Reasoning, 40(4):327-356, May 2008.
39. Lucian Wischik and Philippa Gardner. Explicit fusions. Theoretical Computer Science, 304(3):606-630, 2005.
40. Lucian Wischik. Explicit Fusions: Theory and Implementation. PhD thesis, Computer Laboratory, University of Cambridge, 2001.