A calculus of mobile processes, II
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
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
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Mechanizing the Metatheory of LF
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in 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 Proof Theoretic Analysis of Intruder Theories
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A trace based bisimulation for the spi calculus: an extended abstract
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Hi-index | 0.00 |
We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the knowledge and capabilities of an observer, and can be given a formal account using deductive systems, such as those used in various "environment-sensitive" bisimulation for process calculi, e.g., the spi-calculus. Two notions are critical to the correctness of such formalisations and the effectiveness of symbolic techniques based on them: decidability of message deduction by the observer and consistency of a given observer theory. We consider a formalisation, in Isabelle/HOL, of both notions based on an encoding of observer theories as pairs of symbolic traces. This encoding has recently been used in a theory of open bisimulation for the spi-calculus. We machine-checked some important properties, including decidability of observer deduction and consistency, and some key steps which are crucial to the automation of open bisimulation checking for the spi-calculus, and highlight some novelty in our Isabelle/HOL formalisations of decidability proofs.