We present a fully automatic algorithm for verifying safety properties of parameterized software systems. This algorithm is based on both IC3 and Lazy Annotation. We implemented it in Cubicle, a model checker for verifying safety properties of array-based systems. Cache-coherence protocols and mutual exclusion algorithms are known examples of such systems. Our algorithm iteratively builds an abstract reachability graph refining the set of reachable states from counter-examples. Refining is made through counter-example approximation. We show the effectiveness and limitations of this algorithm and tradeoffs that results from it.

We formally define - at the stream transformer level - a class of synchronous circuits that tolerate any variability in the latency of their environment. We study behavioral properties of networks of such circuits and prove fundamental compositionality results. The paper contributes to bridging the gap between the theory of latency-insensitive systems and the correct implementation of efficient control structures for them

reFLect is a new functional language, developed at Intel for use in hardware design and verification. It contains features intended to facilitate the construction, analysis, and manipulation of the language's own programs. It is also intended to be the executable subset of the term language of a theorem prover based on higher order logic.In this paper, we consider core reFLect---a language that extends a polymorphically typed λ-calculus with a datatype for programs and with constructs for splicing programs into programs and for defining functions that inspect and modify programs. We prove that the reduction semantics for this language is strongly normalizing and confluent. We also give a set-theoretical denotational semantics for the language and prove that the reduction semantics is sound with respect to the denotational semantics. These results provide the basis for developing the semantics of reFLect's extension of higher order logic and proving its soundness.