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
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation
Journal of Automated Reasoning
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries.The translation has been implemented in a prototype tool.As a consequence, protocols can be described in the spi calculus and analysed with the emerging flora of tools already available for 驴.The translation also entails a more detailed ooperational understanding of spi since high level constructs like encryption are encoded in a well known lower level.The formal correctness proof is nontrivial and interesting in its own; so called context bisimulations and new techniques for compositionality make the proof simpler and more concise.