# Difference between revisions of "Matching logic"

From FSL

m (Grosu moved page Matching Logic --- Extended Abstract to Matching logic) |
|||

Line 1: | Line 1: | ||

+ | This wikipage contains the main papers on matching logic. | ||

+ | The LMCS paper is a comprehensive extension of the invited RTA'15 conference paper. | ||

+ | |||

== LMCS == | == LMCS == | ||

<pubbib id='rosu-2017-lmcs' template='PubDefaultWithAbstractAndTitle'/> | <pubbib id='rosu-2017-lmcs' template='PubDefaultWithAbstractAndTitle'/> | ||

== RTA'15 == | == RTA'15 == | ||

<pubbib id='rosu-2015-rta' template='PubDefaultWithAbstractAndTitle'/> | <pubbib id='rosu-2015-rta' template='PubDefaultWithAbstractAndTitle'/> |

## Revision as of 15:36, 1 June 2017

This wikipage contains the main papers on matching logic. The LMCS paper is a comprehensive extension of the invited RTA'15 conference paper.

## LMCS

**Matching logic**- Grigore Rosu
, Volume 13(4), pp 1-61. 2017**LMCS**

*Abstract.*This paper presents*matching logic*, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the*patterns*, are constructed using*variables*,*symbols*,*connectives*and*quantifiers*, but no difference is made between function and predicate symbols. In models, a pattern evaluates into a power-set domain (the set of values that*match*it), in contrast to FOL where functions and predicates map into a regular domain. Matching logic uniformly generalizes several logical frameworks important for program analysis, such as: propositional logic, algebraic specification, FOL with equality, modal logic, and separation logic. Patterns can specify separation requirements at any level in any program configuration, not only in the heaps or stores, without any special logical constructs for that: the very nature of pattern matching is that if two structures are matched as part of a pattern, then they can only be spatially separated. Like FOL, matching logic can also be translated into pure predicate logic with equality, at the same time admitting its own sound and complete proof system. A practical aspect of matching logic is that FOL reasoning with equality remains sound, so off-the-shelf provers and SMT solvers can be used for matching logic reasoning. Matching logic is particularly well-suited for reasoning about programs in programming languages that have an operational semantics, but it is not limited to this.

## RTA'15

**Matching Logic --- Extended Abstract**- Grigore Rosu
, Leibniz International Proceedings in Informatics (LIPIcs) 36, pp 5-21. 2015**RTA'15**

*Abstract.*This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives and quantifiers, but no difference is made between function and predicate symbols. In models, a pattern evaluates into a power-set domain (the set of values that match it), in contrast to FOL where functions and predicates map into a regular domain. Matching logic uniformly generalizes several logical frameworks important for program analysis, such as: propositional logic, algebraic specification, FOL with equality, and separation logic. Patterns can specify separation requirements at any level in any program configuration, not only in the heaps or stores, without any special logical constructs for that: the very nature of pattern matching is that if two structures are matched as part of a pattern, then they can only be spatially separated. Like FOL, matching logic can also be translated into pure predicate logic, at the same time admitting its own sound and complete proof system. A practical aspect of matching logic is that FOL reasoning remains sound, so off-the-shelf provers and SMT solvers can be used for matching logic reasoning. Matching logic is particularly well-suited for reasoning about programs in programming languages that have a rewrite-based operational semantics.