IC3 and beyond: Incremental, inductive verification

32Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

IC3, a SAT-based safety model checking algorithm introduced in 2010 [1, 2], is considered among the best safety model checkers. This tutorial discusses its essential ideas: the use of concrete states, called counterexamples to induction, to motivate lemma discovery; the incremental application of induction to generate the lemmas; and the use of stepwise assumptions to allow dynamic shifting between inductive lemma generation and propagation of lemmas as predicates. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bradley, A. R. (2012). IC3 and beyond: Incremental, inductive verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7358 LNCS, p. 4). https://doi.org/10.1007/978-3-642-31424-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free