Abstract

In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed-calculus. Inhabitants (terms) of these types represent proofs. The speci c typed-calculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ.

Citations

474	Lambda Calculi with Types - Barendregt - 1992
417	The calculus of constructions - Coquand, Huet - 1988
143	Inductive definitions in the system Coq: Rules and properties - Paulin-Mohring - 1993
126	An overview of LP, the Larch Prover - Garland, Guttag
98	The syntax and semantics of CRL - Groote, Ponse - 1990
57	The algebra of recursively defined processes and the algebra of regular processes - Bergstra, Klop - 1984
31	A Calculus of Communicating Systems, volume 92 - Milner - 1980
18	A computer-checked verification of Milner's scheduler - Korver, Springintveld - 1994
17	Proof theory for CRL - Groote, Ponse - 1991
13	A formal verification of the alternating bit protocol in the calculus of constructions - Bezem, Groote - 1993
13	The Coq proof assistant version 5.6 user's guide - Dowek, Felty, et al. - 1991
12	Inductive de nitions in the system Coq : Rules and Properties - Paulin-Mohring - 1993
7	Type theory and concurrency - Cleaveland, Panangaden - 1988
5	The algebra of recursively de ned processes and the algebra of regular processes - Bergstra, Klop - 1984
3	A formal veri cation of the alternating bit protocol in the calculus of constructions - Bezem, Groote - 1993
3	A computer-checked veri cation of Milner's scheduler - Korver, Springintveld
2	Towards a formal mathematical vernacular - Groote - 1992