DocumentCode :
561373
Title :
IC3: Where monolithic and incremental meet
Author :
Somenzi, Fabio ; Bradley, Aaron R.
Author_Institution :
Dept. of Electr., Comput., & Energy Eng., Univ. of Colorado at Boulder, Boulder, CO, USA
fYear :
2011
fDate :
Oct. 30 2011-Nov. 2 2011
Firstpage :
3
Lastpage :
8
Abstract :
IC3 is an approach to the verification of safety properties based on relative induction. It is incremental in the sense that instead of focusing on proving one assertion, it builds a sequence of small, relatively easy lemmas. These lemmas are in the form of clauses that are derived from counterexamples to induction and that are inductive relative to reachability assumptions. At the same time, IC3 progressively refines approximations of the states reachable in given numbers of steps. These approximations, also made up of clauses, are among the assumptions used to support the inductive reasoning, while their strengthening relies on the inductive clauses themselves. This interplay of the incremental and monolithic approaches lends IC3 efficiency and flexibility and produces high-quality property-driven abstractions. In contrast to other SAT-based approaches, IC3 performs very many, very inexpensive queries. This is another consequence of the incrementality of the algorithm and is a key to its ability to be implemented in highly parallel fashion.
Keywords :
approximation theory; computability; formal verification; inference mechanisms; IC3 technique; SAT-based approach; incremental approach; inductive reasoning; monolithic approach; propety-driven abstraction; relative induction; safety property verification; Approximation methods; Boolean functions; Computational modeling; Context; Data structures; Encoding; Safety;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Formal Methods in Computer-Aided Design (FMCAD), 2011
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4673-0896-0
Type :
conf
Filename :
6148908
Link To Document :
بازگشت