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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.