Formalizing process algebraic verifications in the calculus of constructions

M.A. Bezem, R.N. Bol, J.F. Groote

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)

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 a ugmented 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.
Original languageEnglish
Pages (from-to)1-48
JournalFormal Aspects of Computing
Volume9
Issue number1
DOIs
Publication statusPublished - 1997

Fingerprint Dive into the research topics of 'Formalizing process algebraic verifications in the calculus of constructions'. Together they form a unique fingerprint.

Cite this