Difference between revisions of "Matching mu-Logic"

From FSL
Jump to: navigation, search
Line 1: Line 1:
<private><pubbib id='chen-rosu-2019-lics-submission' template='PubDefaultWithAbstractAndTitle'/></private>
+
== Technical Report ==
 
+
 
<pubbib id='chen-rosu-2019-tr' template='PubDefaultWithAbstractAndTitle'/>
 
<pubbib id='chen-rosu-2019-tr' template='PubDefaultWithAbstractAndTitle'/>
 +
<private>
 +
== LICS 2019 Submission ==
 +
<pubbib id='chen-rosu-2019-lics-submission' template='PubDefaultWithAbstractAndTitle'/>
 +
</private>

Revision as of 05:47, 20 January 2019

Technical Report

Matching mu-Logic
Xiaohong Chen and Grigore Rosu
Technical Report http://hdl.handle.net/2142/102281, January 2019
Abstract. Matching logic is a logic for specifying and reasoning about structure by means of patterns and pattern matching. This paper makes two contributions. First, it proposes a sound and complete proof system for matching logic in its full generality. Previously, sound and complete deduction for matching logic was known only for particular theories providing equality and membership. Second, it proposes matching mu-logic, an extension of matching logic with a least fixpoint mu-binder. It is shown that matching mu-logic captures as special instances many important logics in mathematics and computer science, including first-order logic with least fixpoints, modal mu-logic as well as dynamic logic and various temporal logics such as infinite/finite-trace linear temporal logic and computation tree logic, and notably reachability logic, the underlying logic of the K framework for programming language semantics and formal analysis. Matching mu-logic therefore serves as a unifying foundation for specifying and reasoning about fixpoints and induction, programming languages and program specification and verification.
PDF, Matching Logic, DOI, BIB


Personal tools
Namespaces

Variants
Actions
Navigation