Verifying Concurrent Protocols Using Refinements

Abstract

We present a framework for the specification and verification of reactive concurrent programs using general-purpose mechanical theorem proving. We show how to use (fair) stuttering trace containment to verify diverse concurrent protocols. We present a collection of proof rules that can be effectively orchestrated by a theorem prover to reason about complex programs using refinements. We demonstrate the use of the framework in the verification of several concurrent programs in ACL2.