## Formalizing Process Algebraic Verifications in the Calculus of Constructions

Citations: | 18 - 7 self |

### BibTeX

@MISC{Bezem_formalizingprocess,

author = {Marc Bezem and Jan Friso Groote and Roland Bol},

title = {Formalizing Process Algebraic Verifications in the Calculus of Constructions},

year = {}

}

### Years of Citing Articles

### OpenURL

### 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 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 small enough to make the verification feasible, and at the same time 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.