(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic

09/04/2019
by   Vlad Rusu, et al.
0

Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and inherit the coinductive nature of the logic. The proof systems differ, however, in several aspects. First, they use induction and coinduction in different proportions. The second aspect regards compositionality, broadly meaning their ability to prove simpler formulas on smaller systems, and to reuse those formulas as lemmas for more complex formulas on larger systems. The third aspect is the difficulty of their soundness proofs. We show that the more induction a proof system uses, and the more specialised is its use of coinduction (with respect to our problem domain), the more compositional the proof system is, but the more difficult its soundness proof becomes. We also briefly present mechanisations of these results in the Isabelle/HOL and Coq proof assistants.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2018

A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems

We introduce a sound and complete coinductive proof system for reachabil...
research
02/19/2018

Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction

A proof tableau of Hoare logic is an annotated program with pre- and pos...
research
10/25/2018

All-Path Reachability Logic

This paper presents a language-independent proof system for reachability...
research
02/02/2018

Infinitary and Cyclic Proof Systems for Transitive Closure Logic

We formulate an infinitary proof system for transitive closure logic, wh...
research
09/13/2019

Reasoning about call-by-value: a missing result in the history of Hoare's logic

We provide a sound and relatively complete Hoare-like proof system for r...
research
07/16/2021

Adelfa: A System for Reasoning about LF Specifications

We present a system called Adelfa that provides mechanized support for r...
research
12/12/2017

Computational Logic: Its Origins and Applications

Computational Logic is the use of computers to establish facts in a logi...

Please sign up or login with your details

Forgot password? Click here to reset