Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.09169 v4 pith:TR3IJPRO submitted 2021-05-19 cs.LO

Tobias Seufert , Felix Winterer , Christoph Scholl , Karsten Scheibler , Tobias Paxian , Bernd Becker This is my paper · ORCID
classification cs.LO
keywords methodsproofgeneralizationobligationsalwaysanalyzesapproachesbeen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools