Abstract
In previous work we proposed an approach to the automatic translation of protocol insecurity problems into propositional logic with the ultimate goal of building an automatic model-checker for security protocols based on state-of-the-art SAT solvers. In this paper we present an improved procedure based on an abstraction/refinement strategy which, by interleaving the encoding and solving phases, leads to a significant improvement of the overall performance of our model-checker. © Springer-Verlag 2004.
Cite
CITATION STYLE
Armando, A., & Compagna, L. (2004). Abstraction-driven SAT-based analysis of security protocols. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2919, 257–271. https://doi.org/10.1007/978-3-540-24605-3_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
