Project : vertecs
Section: New Results
Applications of theorem proving
Participant : Vlad Rusu.
Compositional verification of an ATM protocol
In this work  an approach based on compositionality, partial-order verification, and interactive theorem proving for verifying communication protocols is presented. The approach is implemented in pvs. Its originality lies more in the combination of the methods than in the methods themselves; and its value is that it scales up to real-size systems. It is demonstrated by verifying a real ATM protocol whose main requirement is to perform a reliable data transfer over an unreliable communication medium.
Extracting a Data Flow Analyser in Constructive Logic
This work has been done in cooperation with David Cachera, Thomas Jensen, and David Pichardie from the Lande project-team of Irisa. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors allowing for a modular construction of complex abstract domains. Constraints are expressed via an intermediate representation that allows for efficient constraint resolution. Correctness with respect to an operational semantics is proved formally. The proof of existence of a correct, minimal solution of the constraints is constructive, which means that the extraction mechanism of Coq provides a provably correct data flow analyser in Ocaml. The library of lattices together with the intermediate representation of constraints are defined in an analysis-independent fashion, thus providing a generic framework for proving and extracting static analysers in Coq. This work will be presented at ESOP in 2004.