Communication and concurrency
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Algebraic theories for name-passing calculi
Information and Computation
A symbolic semantics for the &pgr;-calculus
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
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
Process Algebraic Analysis of Cryptographic Protocols
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Non-interference proof technique for the analysis of cryptographic protocols
Journal of Computer Security - Special issue on WITS'03
Theoretical Computer Science
A framework for compositional verification of security protocols
Information and Computation
A simple language for real-time cryptographic protocol analysis
ESOP'03 Proceedings of the 12th European conference on Programming
Component-oriented verification of noninterference
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Observational equivalences can be used to reason about the correctness of security protocols described in the spi-calculus. Unlike in CCS or in 驴-calculus, these equivalences do not enjoy a simple formulation in spi-calculus. The present paper aims at enriching the set of tools for reasoning on processes by providing a few equational laws for a sensible notion of spi-bisimilarity. We discuss the difficulties underlying compositional reasoning in spi-calculus and show that, in some cases and with some care, the proposed laws can be used to build compositional proofs. A selection of these laws forms the basis of a proof system that we show to be sound and complete for the strong version of bisimilarity.