Back to ProVerif
Bruno Blanchet. The Security Protocol Verifier ProVerif and its Horn Clause Resolution Algorithm. In Geoffrey W. Hamilton, Temesghen Kahsai, and Maurizio Proietti, editors, 9th Workshop on Horn Clauses for Verification and Synthesis (HCVS), volume 373 of EPTCS, pages 14-22. Open Publishing Association, November 2022. Survey

Get the paper

.pdf, 208 Kb


Official version


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.


  AUTHOR = {Bruno Blanchet},
  TITLE = {The Security Protocol Verifier {P}ro{V}erif and its {H}orn Clause Resolution Algorithm},
  BOOKTITLE = {9th Workshop on Horn Clauses for Verification and Synthesis (HCVS)},
  YEAR = 2022,
  EDITOR = {Geoffrey W. Hamilton and Temesghen Kahsai and Maurizio Proietti},
  VOLUME = 373,
  PAGES = {14--22},
  PUBLISHER = {Open Publishing Association}