Work

Checking reachability using matching logic

Year: 2012
Type: conference-paper
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.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W2109693366
FWCI: 6.059
Cites: 40
Cited by: 74
Related to: 10