scholarly journals Software model-checking as cyclic-proof search

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.

2016 ◽  
Vol 51 (8) ◽  
pp. 1-2
Author(s):  
Waqas Ur Rehman ◽  
Muhammad Sohaib Ayub ◽  
Junaid Haroon Siddiqui

2008 ◽  
Vol 43 (10) ◽  
pp. 493-504 ◽  
Author(s):  
Michael Roberson ◽  
Melanie Harries ◽  
Paul T. Darga ◽  
Chandrasekhar Boyapati

2015 ◽  
Vol 5 (2) ◽  
pp. 373-402 ◽  
Author(s):  
Nazim Sebih ◽  
Masami Hagiya ◽  
Franz Weitl ◽  
Mitsuharu Yamamoto ◽  
Cyrille Artho ◽  
...  

2006 ◽  
Vol 157 (1) ◽  
pp. 77-94
Author(s):  
Murray Stokely ◽  
Sagar Chaki ◽  
Joël Ouaknine

Sign in / Sign up

Export Citation Format

Share Document