Pict correctness revisited

The Pict programming language is an implementation of the @p-calculus in which executions of @p-calculus terms are specified via an abstract machine. An important property of any concurrent programming language implementation is the fair execution of threads. After defining fairness for the @p-calculus, we show that Pict abstract machine executions implement fair @p-calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine.

[1]  Peter Sewell,et al.  Nomadic Pict: language and infrastructure design for mobile agents , 1999, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents.

[2]  Nobuko Yoshida,et al.  A Distributed Abstract Machine for Boxed Ambient Calculi , 2004, ESOP.

[3]  Peter Sewell,et al.  Nomadic Pict: language and infrastructure design for mobile agents , 2000, IEEE Concurr..

[4]  Marc Lacoste,et al.  An Abstract Machine for a Higher-Order Distributed Process Calculus , 2002, Electron. Notes Theor. Comput. Sci..

[5]  Davide Sangiorgi,et al.  A Correct Abstract Machine for Safe Ambients , 2005, COORDINATION.

[6]  Cosimo Laneve,et al.  The Fusion Machine , 2002, CONCUR.

[7]  Davide Sangiorgi,et al.  Safe Ambients: Abstract machine and distributed implementation , 2006, Sci. Comput. Program..

[8]  G. Plotkin,et al.  Proof, language, and interaction: essays in honour of Robin Milner , 2000 .

[9]  Peter Sewell,et al.  On Implementations and Semantics of a Concurrent Programming Language , 1997, CONCUR.

[10]  Alan Schmitt,et al.  An Abstract Machine for the Kell Calculus , 2005, FMOODS.

[11]  Peter Sewell,et al.  Nomadic pict: correct communication infrastructure for mobile computation , 2001, POPL '01.

[12]  Fabrice Le Fessant.  JoCaml : conception et implémentation d'un langage à agents mobiles , 2001 .

[13]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1987, Inf. Comput..

[14]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[15]  Catuscia Palamidessi,et al.  Separation of Synchronous and Asynchronous Communication Via Testing , 2005, EXPRESS.

[16]  Naoki Kobayashi,et al.  A Type System for Lock-Free Processes , 2002, Inf. Comput..

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

[18]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[19]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[20]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

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

[22]  Jean-Jacques Lévy,et al.  An Asynchronous, Distributed Implementation of Mobile Ambients , 2000, IFIP TCS.