DeepAI AI Chat
Log In Sign Up

Software Model-Checking as Cyclic-Proof Search

11/10/2021
by   Takeshi Tsukada, et al.
0

This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for a non-standard proof system, known as a cyclic proof system. Our use of the cyclic proof system as a logical foundation of software model checking enables us to compare different algorithms, to reconstruct well-known algorithms from a few simple principles, and to obtain soundness proofs of algorithms for free. Among others, we show the significance of a heuristics based on a notion that we call maximal conservativity; this explains the cores of important algorithms such as property-directed reachability (PDR) and reveals a surprising connection to an efficient solver of games over infinite graphs that was not regarded as a kind of PDR.

READ FULL TEXT
07/08/2012

Minimal Proof Search for Modal Logic K Model Checking

Most modal logics such as S5, LTL, or ATL are extensions of Modal Logic ...
05/19/2021

Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR

In this paper we revisit the topic of generalizing proof obligations in ...
10/09/2019

Generalized Property-Directed Reachability for Hybrid Systems

Generalized property-directed reachability (GPDR) belongs to the family ...
06/24/2016

A Dynamic Epistemic Framework for Conformant Planning

In this paper, we introduce a lightweight dynamic epistemic logical fram...
09/07/2021

E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning

Checking the soundness of cyclic induction reasoning for first-order log...
07/23/2019

Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space

The paper details the first successful attempt at using model-checking t...
11/18/2019

Combined Covers and Beth Definability

In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exp...