Difference between revisions of "Checking Reachability using Matching Logic"
From FSL
| Line 6: | Line 6: | ||
<pub id='rosu-stefanescu-2012-tr-g' template='PubDefaultWithAbstractAndTitle' draft/><private> | <pub id='rosu-stefanescu-2012-tr-g' template='PubDefaultWithAbstractAndTitle' draft/><private> | ||
<pub id='rosu-stefanescu-2012-tr-d' template='PubDefaultWithAbstractAndTitle'/></private> | <pub id='rosu-stefanescu-2012-tr-d' template='PubDefaultWithAbstractAndTitle'/></private> | ||
| + | |||
| + | * ana | ||
| + | * are | ||
| + | * mere | ||
Revision as of 03:40, 28 February 2013
OOPSLA'12
- Checking Reachability using Matching Logic
- Grigore Rosu and Andrei Stefanescu
- OOPSLA'12, ACM, pp 555-574. 2012
- 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.
Technical Report
- Checking Reachability using Matching Logic
- Grigore Rosu and Andrei Stefanescu
- Technical Report http://hdl.handle.net/2142/33771, August 2012
- 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.
- ana
- are
- mere
