Formalizing process algebraic verifications in the calculus of constructions

Abstract

Abstract This paper reports on the first steps towards the formal verification of correctness proofs of real-life protocols in process algebra. We show that such proofs can be verified, and partly constructed, by a general purpose proof checker. The process algebra we use is μ CRL, ACP τ augmented with data, which is expressive enough for the specification of real-life protocols. The proof checker we use is Coq, which is based on the Calculus of Constructions, an extension of simply typed lambda calculus. The focus is on the translation of the proof theory of μ CRL and μ CRL-specifications to Coq. As a case study, we verified the Alternating Bit Protocol.