A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Matching Logic: An Alternative to Hoare/Floyd Logic
[chapter]
2011
Lecture Notes in Computer Science
This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic specifications are particular first-order formulae with constrained algebraic structure, called patterns. Program configurations satisfy patterns iff they match their algebraic structure and satisfy their constraints. Using a simple imperative language (IMP), it is shown that a restricted use of the matching logic proof system is
doi:10.1007/978-3-642-17796-5_9
fatcat:zz5usc3qjjbgbd7a7oladuorhy