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

05/19/2021
by   Tobias Seufert, et al.
0

In this paper we revisit the topic of generalizing proof obligations in bit-level Property Directed Reachability (PDR). We provide a comprehensive study which (1) determines the complexity of the problem, (2) thoroughly analyzes limitations of existing methods, (3) introduces approaches to proof obligation generalization that have never been used in the context of PDR, (4) compares the strengths of different methods from a theoretical point of view, and (5) intensively evaluates the methods on various benchmarks from hardware model checking as well as from AI planning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2021

Software Model-Checking as Cyclic-Proof Search

This paper shows that a variety of software model-checking algorithms ca...
research
04/30/2020

PrIC3: Property Directed Reachability for MDPs

IC3 has been a leap forward in symbolic model checking. This paper propo...
research
10/09/2019

Generalized Property-Directed Reachability for Hybrid Systems

Generalized property-directed reachability (GPDR) belongs to the family ...
research
09/11/2023

Soundness and Completeness of a Model-Checking Proof System for CTL

We propose a local model-checking proof system for a fragment of CTL. Th...
research
11/03/2021

Fair Mutual Exclusion for N Processes (extended version)

Peterson's mutual exclusion algorithm for two processes has been general...
research
09/07/2017

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Since the introduction of Alternating-time Temporal Logic (ATL), many lo...

Please sign up or login with your details

Forgot password? Click here to reset