A Fully Abstract Encoding of the pi-Calculus with Data Terms

The π-calculus with data terms (πT) extends the pure π-calculus by data constructors and destructors and allows data to be transmitted between agents. It has long been known how to encode such data types in π, but until now it has been open how to make the encoding fully abstract, meaning that two encodings (in π) are semantically equivalent precisely when the original πT agents are semantically equivalent. We present a new type of encoding and prove it to be fully abstract with respect to may-testing equivalence. To our knowledge this is the first result of its kind, for any calculus enriched with data terms. It has particular importance when representing security properties since attackers can be regarded as may-test observers. Full abstraction proves that it does not matter whether such observers are formulated in π or πT, both are equally expressive in this respect. The technical new idea consists of achieving full abstraction by encoding data as table entries rather than active processes, and using a firewalled central integrity manager to ensure data security.

[1]  Björn Victor,et al.  Spi calculus translated to /spl pi/-calculus preserving may-tests , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[2]  James G. Anderson.  Evaluation and Reflections on the Design of the WeAidU system , 2005 .

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

[4]  Claes Olsson,et al.  Structure Flexibility Impacts on Robust Active Vibration Isolation Using Mixed Sensitivity Optimisation , 2007 .

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

[6]  Per Lötstedt,et al.  Adaptive, Conservative Solution of the Fokker-Planck Equation in Molecular Biology , 2004 .

[7]  Niklas Johansson,et al.  A Design Case: Interactive Sports Content Broadcasting , 2004 .

[8]  Uwe Nestmann.  What is a ‘Good’ Encoding of Guarded Choice? , 1997 .

[9]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[10]  Claes Olsson,et al.  Comparative Study of Recursive Parameter Estimation Algorithms with Application to Active Vibration Isolation , 2004 .

[11]  Uwe Nestmann,et al.  On Bisimulations for the Spi Calculus , 2002, AMAST.

[12]  Jean-Pierre Jouannaud,et al.  TAPSOFT'93: Theory and Practice of Software Development , 1993, Lecture Notes in Computer Science.

[13]  Torsten Söderström,et al.  Recursive algorithms for estimating parameters in a one-dimensional diffusion system: derivation and implementation , 2004 .

[14]  Paul Pettersson,et al.  Kelb — A Real-Time Programming Environment for the Sony AIBO , 2004 .

[15]  Erik Borälv,et al.  Design and evaluation of the CHILI system , 2004 .

[16]  Joachim Parrow,et al.  A Fully Abstract Encoding of the π-Calculus with Data Terms (Extended Abstract) , 2005 .

[17]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[19]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[20]  Jonas Persson,et al.  Space-time adaptive finite difference method for European multi-asset options , 2007, Comput. Math. Appl..

[21]  Martín Abadi,et al.  Secure implementation of channel abstractions , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[22]  Rocco De Nicola,et al.  Proof techniques for cryptographic processes , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[23]  Robin Milner.  Functions as Processes , 1990, ICALP.

[24]  Arne Andersson,et al.  A flexible model for tree-structured multi-commodity markets , 2007, Electron. Commer. Res..

[25]  Uwe Nestmann,et al.  Symbolic Bisimulation in the Spi Calculus , 2004, CONCUR.

[26]  Anna Eckerdal.  On the Understanding of Object and Class , 2004 .

[27]  Jarmo Rantakokko,et al.  Algorithmic optimizations of a conjugate gradient solver on shared memory architectures , 2006, Int. J. Parallel Emergent Distributed Syst..

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

[29]  Davide Sangiorgi,et al.  From -calculus to Higher-order -calculus | and Back , 2007 .

[30]  Henrik Brandén,et al.  Preconditioners Based on Fundamental Solutions , 2005 .

[31]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[32]  Davide Sangiorgi,et al.  From pi-Calculus to Higher-Order pi-Calculus - and Back , 1993, TAPSOFT.

[33]  Robert J. Townsley,et al.  What is a Good? , 1999 .

[34]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

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

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

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

[38]  Stefan Johansson,et al.  High order summation by parts operator based on a DRP scheme applied to 2D Aeroacoustics , 2004 .

[39]  Björn Victor,et al.  Spi Calculus Translated to --Calculus Preserving May-Tests , 2004, LICS 2004.