efficient solver
Recently Published Documents


TOTAL DOCUMENTS

65
(FIVE YEARS 22)

H-INDEX

12
(FIVE YEARS 2)

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-29
Author(s):  
Takeshi Tsukada ◽  
Hiroshi Unno

This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for a non-standard proof system, known as a cyclic proof system . Our use of the cyclic proof system as a logical foundation of software model checking enables us to compare different algorithms, to reconstruct well-known algorithms from a few simple principles, and to obtain soundness proofs of algorithms for free. Among others, we show the significance of a heuristics based on a notion that we call maximal conservativity ; this explains the cores of important algorithms such as property-directed reachability (PDR) and reveals a surprising connection to an efficient solver of games over infinite graphs that was not regarded as a kind of PDR.


PAMM ◽  
2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Karl Schoppmann ◽  
Bastian Löhrer ◽  
Silvio Tschisgale ◽  
Jochen Fröhlich ◽  
Emmanuel de Langre

2020 ◽  
Vol 80 (11) ◽  
pp. 2586-2603
Author(s):  
Gabriele Loli ◽  
Monica Montardini ◽  
Giancarlo Sangalli ◽  
Mattia Tani

2020 ◽  
Vol 422 ◽  
pp. 109754 ◽  
Author(s):  
Parry Y. Chen ◽  
Yonatan Sivan ◽  
Egor A. Muljarov

Sign in / Sign up

Export Citation Format

Share Document