Checking Reachability using Matching Logic

Grigore Rosu and Andrei Stefanescu
OOPSLA'12 ACM, pp 555-574, Oct 2012
PDF BIB OOPSLA'12 Matching Logic

Abstract. This paper presents a verification framework that is parametric in a (trusted) operational semantics of some programming language. The underlying proof system is language-independent and consists of eight proof rules. The proof system is proved partially correct and relatively complete (with respect to the programming language configuration model). To show its practicality, the generic framework is instantiated with a fragment of C and evaluated with encouraging results.