The Lattice-Theoretic Essence of Property Directed Reachability Analysis

03/27/2022
by   Mayuko Kori, et al.
0

We present LT-PDR, a lattice-theoretic generalization of Bradley's property directed reachability analysis (PDR) algorithm. LT-PDR identifies the essence of PDR to be an ingenious combination of verification and refutation attempts based on the Knaster-Tarski and Kleene theorems. We introduce four concrete instances of LT-PDR, derive their implementation from a generic Haskell implementation of LT-PDR, and experimentally evaluate them. We also present a categorical structural theory that derives these instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2023

Exploiting Adjoints in Property Directed Reachability Analysis

We formulate, in lattice-theoretic terms, two novel algorithms inspired ...
research
08/23/2023

Incremental Property Directed Reachability

Property Directed Reachability (PDR) is a widely used technique for form...
research
08/05/2022

Property Directed Reachability for Generalized Petri Nets

We propose a semi-decision procedure for checking generalized reachabili...
research
11/17/2017

A Supervisory Control Algorithm Based on Property-Directed Reachability

We present an algorithm for synthesising a controller (supervisor) for a...
research
05/28/2018

Ranking and Repulsing Supermartingales for Approximating Reachability

Computing reachability probabilities is a fundamental problem in the ana...
research
07/12/2023

FGo: A Directed Grey-box Fuzzer with Probabilistic Exponential cut-the-loss Strategies

Traditional coverage grey-box fuzzers perform a breadth-first search of ...
research
10/30/2021

Property-Directed Reachability as Abstract Interpretation in the Monotone Theory

Inferring inductive invariants is one of the main challenges of formal v...

Please sign up or login with your details

Forgot password? Click here to reset