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

04/23/2018
by   Ştefan Ciobâcă, et al.
0

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the calculus is a circularity proof rule, which allows to obtain finite representations of the infinite coinductive proofs.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

09/04/2019

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

Reachability Logic is a formalism that can be used, among others, for ex...
03/02/2021

Focus-style proof systems and interpolation for the alternation-free μ-calculus

In this paper we introduce a cut-free sequent calculus for the alternati...
10/25/2018

All-Path Reachability Logic

This paper presents a language-independent proof system for reachability...
03/27/2013

Selecting Uncertainty Calculi and Granularity: An Experiment in Trading-Off Precision and Complexity

The management of uncertainty in expert systems has usually been left to...
12/13/2018

VASS reachability in three steps

This note is a product of digestion of the famous proof of decidability ...
01/13/2020

Decisiveness of Stochastic Systems and its Application to Hybrid Models

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an in...
09/28/2020

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version)

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an in...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.