Mechanizing a proof by induction of process algebra specifications in higher order logic

Abstract

When dealing with inductively defined systems, correctness proofs of different specifications of the same system cannot be accomodated in a framework based on finite state automata. Instead, these systems can be naturally analysed and verified by manipulating the process algebra specifications by means of equational reasoning. In this paper, we describe an attempt to mechanize a proof by mathematical induction of the correctness of a simple buffer. To achieve this goal, we use the interactive theorem prover HOL to support the theory of observational congruence for CCS, and provide a set of axiomatic proof tools which can be used interactively.