Spi calculus translated to /spl pi/-calculus preserving may-tests

M. Baldamus, J. Parrow, B. Victor
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
We present a concise and natural encoding of the spicalculus 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
more » ... s a more detailed operational 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.
doi:10.1109/lics.2004.1319597 dblp:conf/lics/BaldamusPV04 fatcat:3sdocx6g7rbzdodtao2gxvuwxe