A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
[chapter]
2002
Lecture Notes in Computer Science
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete
doi:10.1007/3-540-45607-4_5
fatcat:ywc6teis6zec7keteoce5hvyny