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

The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names ...

[1]  Björn Victor,et al.  Weak Equivalences in Psi-Calculi , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[2]  Magnus Johansson.  Psi-calculi: a framework for mobile process calculi : Cook your own correct process calculus - just add data and logic , 2010 .

[3]  Björn Victor,et al.  Extended pi-Calculi , 2008, ICALP.

[4]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[5]  Uwe Nestmann,et al.  On bisimulations for the spi calculus , 2005, Math. Struct. Comput. Sci..

[6]  Massimo Merro.  On the Expressiveness of Chi, Update, and Fusion calculi , 1998, EXPRESS.

[7]  Jesper Bengtson,et al.  Formalising process calculi , 2010 .

[8]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[9]  Mark Ryan,et al.  Symbolic bisimulation for the applied pi calculus , 2007, J. Comput. Secur..

[10]  Camilo Rueda,et al.  Pi+- Calculus: A Calculus for Concurrent Processes with Constraints , 1998, CLEI Electron. J..

[11]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[12]  Lucian Wischik,et al.  Explicit Fusions: Theory and Implementation , 2001 .

[13]  Clemens Ballarin.  Locales and Locale Expressions in Isabelle/Isar , 2003, TYPES.

[14]  Jean Goubault-Larrecq,et al.  A Probabilistic Applied Pi-Calculus , 2007, APLAS.

[15]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[16]  Yuxi Fu.  A Proof Theoretical Approach to Communication , 1997, ICALP.

[17]  Christian Urban,et al.  Nominal Techniques in Isabelle/HOL , 2005, Journal of Automated Reasoning.

[18]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[19]  Joachim Parrow,et al.  Formalising the pi-Calculus Using Nominal Logic , 2007, FoSSaCS.

[20]  Ugo Montanari,et al.  Open Bisimulation for the Concurrent Constraint Pi-Calculus , 2008, ESOP.

[21]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[22]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[23]  Joachim Parrow,et al.  Formalising the pi-Calculus Using Nominal Logic , 2007, FoSSaCS.

[24]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[25]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[26]  Joachim Parrow,et al.  Psi-calculi in Isabelle , 2009, TPHOLs.

[27]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[28]  Björn Victor,et al.  A Fully Abstract Symbolic Semantics for Psi-Calculi , 2010, SOS.

[29]  Jens Chr. Godskesen.  Observables for Mobile and Wireless Broadcasting Systems , 2010, COORDINATION.

[30]  Mark Ryan,et al.  Analysis of an Electronic Voting Protocol in the Applied Pi Calculus , 2005, ESOP.

[31]  Joachim Niehren,et al.  Constraints for Free in Concurrent Computation , 1995, ASIAN.

[32]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[33]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[34]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[35]  Stéphanie Delaune,et al.  Symbolic bisimulation for the applied pi calculus , 2010, J. Comput. Secur..

[36]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[37]  Björn Victor,et al.  Psi-calculi: Mobile Processes, Nominal Data, and Logic , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[38]  Ugo Montanari,et al.  CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements , 2007, ESOP.

[39]  Tom Chothia,et al.  A Distributed Pi-Calculus with Local Areas of Communication , 2000, Electron. Notes Theor. Comput. Sci..

[40]  Michaël Rusinowitch,et al.  Relating two standard notions of secrecy , 2006, Log. Methods Comput. Sci..

[41]  Gert Smolka.  A Foundation for Higher-order Concurrent Constraint Programming , 1994, CCL.

[42]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .