Difference between revisions of "Checking Reachability using Matching Logic"

From FSL
Jump to: navigation, search
Line 5: Line 5:
 
<pub id='rosu-stefanescu-2012-splash-submission' template='PubDefaultWithAbstractAndTitle'/>
 
<pub id='rosu-stefanescu-2012-splash-submission' template='PubDefaultWithAbstractAndTitle'/>
 
== Technical Report ==
 
== Technical Report ==
<pub id='rosu-stefanescu-2012-tr-g' template='PubDefaultWithAbstractAndTitle' draft/>
+
<pubbib id='rosu-stefanescu-2012-tr-g' template='PubDefaultWithAbstractAndTitle' />
<pub id='rosu-stefanescu-2012-tr-d' template='PubDefaultWithAbstractAndTitle'/>
+
 
</private>
 
</private>

Revision as of 21:52, 26 February 2016

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.
PDF, Slides(PPTX), Slides(PDF), Matching Logic, DOI, OOPSLA'12, BIB


Personal tools
Namespaces

Variants
Actions
Navigation