StatVerif: Verification of Stateful Processes

Myrto Arapinis, Eike Ritter, Mark Ryan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Citations (Scopus)


We present StatVerif, which is an extension the ProVerif process calculus with constructs for explicit state, in order to be able to reason about protocols that manipulate global state. Global state is required by protocols used in hardware devices (such as smart cards and the TPM), as well as by protocols involving databases that store persistent information. We provide the operational semantics of StatVerif. We extend the ProVerif compiler to a compiler for StatVerif: it takes processes written in the extended process language, and produces Horn clauses. Our compilation is carefully engineered to avoid many false attacks. We prove the correctness of the StatVerif compiler. We illustrate our method on two examples: a small hardware security device, and a contract signing protocol. We are able to prove their desired properties automatically.
Original languageEnglish
Title of host publicationProceedings 2011 IEEE 24th Computer Security Foundations Symposium (CSF)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages15
ISBN (Print)978-0-7695-4365-9
Publication statusPublished - 29 Jun 2011
Event2011 IEEE 24th Computer Security Foundations Symposium (CSF) - Cernay-la-Ville, France
Duration: 27 Jun 201129 Jun 2011


Conference2011 IEEE 24th Computer Security Foundations Symposium (CSF)


Dive into the research topics of 'StatVerif: Verification of Stateful Processes'. Together they form a unique fingerprint.

Cite this