Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols
Information and Computation
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Secure Implementation of Channel Abstractions
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Spi Calculus Translated to "--Calculus Preserving May-Tests
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A stochastic pi calculus for concurrent objects
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
Hi-index | 0.00 |
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.