Communication and concurrency
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
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
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Compositional Reasoning in the Spi-calculus
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Theoretical Computer Science
Implementing Spi Calculus Using Nominal Techniques
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalising Observer Theory for Environment-Sensitive Bisimulation
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A trace based bisimulation for the spi calculus: an extended abstract
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation
Journal of Automated Reasoning
A testing theory for a higher-order cryptographic language
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Hi-index | 0.01 |
The spi calculus is an extension of the pi calculus with cryptographic primitives, which was designed for the verification of cryptographic protocols. Because of this extension, the naive adaptation of labelled bisimulations from the pi calculus is too strong to be useful for the purposes of verification. Instead, as a viable alternative, several ‘environment-sensitive’ bisimulations have been proposed. In this paper, we present a formal study of the differences between these bisimulations.