Psi-calculi: Mobile processes, nominal data, and logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 39-48

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

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC PROPERTIES; BISIMULATIONS; COMMUNICATION CHANNEL; CONCURRENT CONSTRAINT; DATA TYPE; FUSION CALCULUS; HIGHER ORDER; INTERACTIVE PROOFS; ISABELLE; LAMBDA CALCULUS; MOBILE PROCESS; OPERATIONAL SEMANTICS; PI CALCULUS; PREDICATE LOGIC; SPI CALCULUS; STRUCTURAL CONGRUENCES;

BIOMINERALIZATION; COMPUTER SCIENCE; DATA STRUCTURES; DIFFERENTIATION (CALCULUS); PATHOLOGY; PATTERN MATCHING; SEMANTICS;

CALCULATIONS;

EID: 70350605776     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.20     Document Type: Conference Paper

References (19)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proceedings of POPL '01, pages 104-115. ACM, Jan. 2001.
2. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The Spi calculus. Journal of Information and Computation, 148(1):1-70, 1999.
3. J. Bengtson and J. Parrow. Psi-calculi in Isabelle. In Proc. of TPHOLs 2009, volume 5674 of LNCS. Springer, 2009. To appear.
4. J. BorgstRöm and U. Nestmann. On bisimulations for the spi calculus. Mathematical Structures in Computer Science, 15(03):487-552, 2005.
5. M. G. Buscemi. Personal communication, Jan. 2009.
6. M. G. Buscemi and U. Montanari. CC-Pi: A constraintbased language for specifying service level agreements. In R. De Nicola, editor, Proceedings of ESOP 2007, volume 4421 of LNCS, pages 18-32. Springer, 2007.
7. M. G. Buscemi and U. Montanari. Open bisimulation for the concurrent constraint pi-calculus. In S. Drossopoulou, editor, Proceedings of ESOP 2008, volume 4960 of LNCS, pages 254-268. Springer, 2008.
8. M. Carbone and S. Maffeis. On the expressive power of polyadic synchronisation in π-Calculus. Nordic Journal of Computing, 10(2):70-98, 2003.
9. V. Cortier, M. Rusinowitch, and E. Zalinescu. Relating two standard notions of secrecy. Logical Methods in Computer Science, 3(3), 2007.
10. S. Delaune, S. Kremer, and M. D. Ryan. Symbolic bisimulation for the applied pi-calculus. In V. Arvind and S. Prasad, editors, Proc. of FSTTCS'07, volume 4855 of LNCS, pages 133-145. Springer, Dec. 2007.
11. M. Gabbay and A. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
12. J. Goubault-Larrecq, C. Palamidessi, and A. Troina. A probabilistic applied pi-calculus. In Proc. of APLAS'07, volume 4807 of LNCS, pages 175-190. Springer, 2007.
13. M. Johansson, J. Parrow, B. Victor, and J. Bengtson. Extended pi-calculi. In Proceedings of ICALP 2008, volume 5126 of LNCS, pages 87-98. Springer, July 2008.
14. S. Kremer and M. D. Ryan. Analysis of an electronic voting protocol in the applied pi-calculus. In M. Sagiv, editor, Proc. of ESOP'05, volume 3444 of LNCS, pages 186-200. Springer, Apr. 2005.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I/II. Journal of Information and Computation, 100:1-77, Sept. 1992.
16. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: a Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
17. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
18. C. Urban. Nominal techniques in Isabelle/HOL. Journal of Automated Reasoning, 40(4):327-356, May 2008.
19. L. Wischik and P. Gardner. Explicit fusions. Theoretical Computer Science, 304(3):606-630, 2005.