Exploiting Adjoints in Property Directed Reachability Analysis
Logic in Computer Science
2023-07-07 v1
Abstract
We formulate, in lattice-theoretic terms, two novel algorithms inspired by Bradley's property directed reachability algorithm. For finding safe invariants or counterexamples, the first algorithm exploits over-approximations of both forward and backward transition relations, expressed abstractly by the notion of adjoints. In the absence of adjoints, one can use the second algorithm, which exploits lower sets and their principals. As a notable example of application, we consider quantitative reachability problems for Markov Decision Processes.
Cite
@article{arxiv.2307.02817,
title = {Exploiting Adjoints in Property Directed Reachability Analysis},
author = {Mayuko Kori and Flavio Ascari and Filippo Bonchi and Roberto Bruni and Roberta Gori and Ichiro Hasuo},
journal= {arXiv preprint arXiv:2307.02817},
year = {2023}
}
Comments
44 pages, 11 figures, the full version of the paper accepted by CAV 2023