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

Autor:	Tobias Seufert, Felix Winterer, Christoph Scholl, Karsten Scheibler, Tobias Paxian, Bernd Becker
Rok vydání:	2023
Předmět:	FOS: Computer and information sciences Computer Science - Logic in Computer Science Electrical and Electronic Engineering Computer Graphics and Computer-Aided Design Software Logic in Computer Science (cs.LO)
Zdroj:	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 42:1351-1364
ISSN:	1937-4151 0278-0070
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::daae755349faa7b654e06e03363f9b04 https://doi.org/10.1109/tcad.2022.3198260 Zobrazit plný text záznamu