Checking Reachability Using Matching Logic

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. Compared to other programming language semantic approaches, operational semantics are easier to understand and define, since the authors can think of them as formal interpreters for the languages they define.

Provided by: Association for Computing Machinery Topic: Software Date Added: Apr 2012 Format: PDF

Find By Topic