A Proof Assistant for PSF

Published: 1991, Last Modified: 26 Jan 2025CAV 1991EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: A description of a tool to support computer-aided construction of proofs for parallel systems is given. In contrast to the conventional approach based on state space exploration, we use an axiomatic approach. The axioms we use for the construction of proofs, are based on ACP. Besides these standard axioms we also consider tactics for shortening proofs. We use PSF (Process Specification Formalism), an extension of ACP with abstract data types, to describe the processes subject to the verification.
Loading