The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, II
Information and Computation
A calculus for cryptographic protocols
Information and Computation
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
On Bisimulations for the Spi Calculus
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Automatic testing equivalence verification of spi calculus specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Secrecy despite compromise: types, cryptography, and the pi-calculus
CONCUR 2005 - Concurrency Theory
Formal security analysis of basic network-attached storage
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Information and Computation
A semantics for web services authentication
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Just fast keying in the pi calculus
ACM Transactions on Information and System Security (TISSEC)
A Type Discipline for Authorization in Distributed Systems
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
Formalising the π-calculus using nominal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A type discipline for authorization policies
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
A complete symbolic bisimulation for full applied pi calculus
Theoretical Computer Science
| Hi-index | 0.00 |
We demonstrate a general framework for extending the pi-calculus with data terms. In this we generalise and improve on several related efforts such as the spic calculus and the pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definition of bisimilarity. We provide general criteria on the semantic equivalence of data terms; with these we prove algebraic laws and that bisimulation is preserved by the operators in the usual way. The definitions are simple enough that an implementation in an automated proof assistant is feasible.