DocumentCode :
651321
Title :
Better generalization in IC3
Author :
Hassan, Zyad ; Bradley, Aaron R. ; Somenzi, Fabio
Author_Institution :
Dept. of Electr., Comput., & Energy Eng., Univ. of Colorado at Boulder, Boulder, CO, USA
fYear :
2013
fDate :
20-23 Oct. 2013
Firstpage :
157
Lastpage :
164
Abstract :
An improved clause generalization procedure for IC3 is presented. Whereas standard generalization extracts a relatively inductive clause from a single state, called a counterexample to induction (CTI), the new procedure also extracts such clauses from other states, called counterexamples to generalization (CTG), that interfere with the primary generalization attempt. The motivation is to enable IC3 to explore states farther from the error states than are CTIs while remaining property-focused. CTGs are strong candidates for being farther but still backward reachable. Significant reductions in the maximum depth reached by IC3´s priority queue-directed explicit backward search indicate that this intention is achieved in practice. The effectiveness of the new procedure is established in two independent implementations of IC3, which demonstrate an increase of 17 and 27, respectively, in the number of solved HWMCC benchmarks.
Keywords :
formal verification; generalisation (artificial intelligence); inference mechanisms; queueing theory; reachability analysis; search problems; CTG; CTI; HWMCC benchmark; IC3 generalization; IC3 priority queue-directed explicit backward search; backward reachability; clause generalization procedure; counterexample to generalization; counterexample to induction; error states; incremental inductive model checking algorithm; inductive clause extraction; Benchmark testing; Computers; Encoding; Engines; Microwave integrated circuits; Model checking; Standards;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Formal Methods in Computer-Aided Design (FMCAD), 2013
Conference_Location :
Portland, OR
Type :
conf
DOI :
10.1109/FMCAD.2013.6679405
Filename :
6679405
Link To Document :
بازگشت