The Security Protocol Verifier ProVerif and its Horn Clause Resolution Algorithm

Bruno Blanchet
(Inria, Paris, France)

ProVerif is a widely used security protocol verifier. Internally, ProVerif uses an abstract representation of the protocol by Horn clauses and a resolution algorithm on these clauses, in order to prove security properties of the protocol or to find attacks. In this paper, we present an overview of ProVerif and discuss some specificities of its resolution algorithm, related to the particular application domain and the particular clauses that ProVerif generates. This paper is a short summary that gives pointers to publications on ProVerif in which the reader will find more details.

In Geoffrey W. Hamilton, Temesghen Kahsai and Maurizio Proietti: Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation (HCVS/VPT 2022), Munich, Germany, 3rd April 2022, Electronic Proceedings in Theoretical Computer Science 373, pp. 14–22.
Published: 22nd November 2022.

ArXived at: http://dx.doi.org/10.4204/EPTCS.373.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org