From Hoare Logic to Matching Logic

Rosu, Grigore

Permalink

https://hdl.handle.net/2142/30471 Copy

Description

Title

From Hoare Logic to Matching Logic

Author(s)

Rosu, Grigore

Contributor(s)

Stefanescu, Andrei

Issue Date

2012-03

Keyword(s)

• Hoare logic
• Matching logic
• Relative completeness
• Program verification

Abstract

Matching logic has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic provides a language-independent and sound proof system that directly uses the trusted operational semantics of the language as axioms. Matching logic thus has a clear practical advantage: it eliminates the need for an additional semantics of the same language in order to reason about programs, and implicitly eliminates the need for tedious soundness proofs. What is not clear, however, is whether matching logic is as powerful as Hoare logic. This paper introduces a technique to mechanically translate Hoare logic proof derivations into equivalent matching logic proof derivations. The presented technique has two consequences: first, it suggests that matching logic has no theoretical limitation over Hoare logic; and second, it provides a new approach to prove Hoare logics sound.

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/30471

Owning Collections