Difference between revisions of "Towards a Unified Theory of Operational and Axiomatic Semantics"
From FSL
| Line 1: | Line 1: | ||
== ICALP'12 == | == ICALP'12 == | ||
| − | < | + | <pubbib id='rosu-stefanescu-2012-icalp' template='PubDefaultWithAbstractAndTitle'/> |
== Submitted to ICALP'12 == | == Submitted to ICALP'12 == | ||
<pub id='rosu-stefanescu-2012-icalp-submission' template='PubDefaultWithAbstractAndTitle'/></private> | <pub id='rosu-stefanescu-2012-icalp-submission' template='PubDefaultWithAbstractAndTitle'/></private> | ||
Revision as of 19:40, 25 February 2016
ICALP'12
- Towards a Unified Theory of Operational and Axiomatic Semantics
- Grigore Rosu and Andrei Stefanescu
- ICALP'12, LNCS 7392, pp 351-363. 2012
- Abstract. This paper presents a nine-rule *language-independent* proof system that takes an operational semantics as axioms and derives program reachability properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules to verify programs, and, implicitly, the tedious step of proving such proof rules sound for each language separately. The key proof rule is *Circularity*, which is coinductive in nature and allows for reasoning about constructs with repetitive behaviors (e.g., loops). The generic proof system is shown sound and has been implemented in the MatchC verifier.
Submitted to ICALP'12
</private>
Technical Reports
- Towards a Unified Theory of Operational and Axiomatic Semantics
- Grigore Rosu and Andrei Stefanescu
- Technical Report http://hdl.handle.net/2142/30827, May 2012
- Abstract. This paper presents a nine-rule *language-independent* proof system that takes an operational semantics as axioms and derives program reachability properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules to verify programs, and, implicitly, the tedious step of proving such proof rules sound for each language separately. The key proof rule is *Circularity*, which is coinductive in nature and allows for reasoning about constructs with repetitive behaviors (e.g., loops). The generic proof system is shown sound and has been implemented in the MatchC verifier.
