Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment
satisfying a given Boolean formula-is a fundamental intractable problem in computer …

IC3 is a recently proposed verification technique for the analysis of sequential circuits. IC3
incrementally overapproximates the state space, refuting potential violations to the property …

In accessing large collections of digitized videos, it is often difficult to find both the
appropriate video file and the portion of the video that is of interest. This paper describes a …

Software-defined networking (SDN) is revolutionizing the networking industry, but current
SDN programming platforms do not provide automated mechanisms for updating global …

We present a novel approach for generalizing the IC3 algorithm for invariant checking from
finite-state to infinite-state transition systems, expressed over some background theories …

We address the problem of verifying invariant properties on infinite-state systems. We
present a novel approach, IC3ia, for generalizing the IC3 invariant checking algorithm from …

Continuous testing during development is a well-established technique for software-quality
assurance. Continuous model checking from revision to revision is not yet established as a …

While bit-level IC3-based algorithms for hardware model checking represent a major
advance over prior approaches, their reliance on propositional clause learning poses …

Typical CEGAR-based verification methods refine the abstract domain based on full
counterexample traces. The finite state model checking algorithm IC3 introduced the …

An improved clause generalization procedure for IC3 is presented. Whereas standard
generalization extracts a relatively inductive clause from a single state, called a …