Verification of Infinite State Systems by Compositional Model Checking
TLDR
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions to reduce types of infinite or unbounded range to small finite types, and arrays of infiniteor unbounded size to small fixed-size arrays.Abstract:
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions to reduce types of infinite or unbounded range to small finite types, and arrays of infinite or unbounded size to small fixed-size arrays. This supports the verification by model checking of systems with unbounded resources and uninterpreted functions. The method is illustrated by application to an implementation of Tomasulo's algorithm, for arbitrary or infinite word size, register file size, number of reservation stations and number of execution units.read more
Citations
More filters
Journal ArticleDOI
Counterexample-guided abstraction refinement for symbolic model checking
TL;DR: An automatic iterative abstraction-refinement methodology that extends symbolic model checking to large hardware designs and devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly.
Book ChapterDOI
Reducing Model Checking of the Many to the Few
E. Allen Emerson,Vineet Kahlon +1 more
TL;DR: Decidability of PMCP is established as it is only necessary to model check a finite number of relatively small systems, and efficient decidability can be obtained in some cases.
Journal Article
Reducing model checking of the many to the few
Ernest A Emerson,Vineet Kahlon +1 more
TL;DR: The decidability of the PMCP in general is established in this article, where it is shown that it is decidable to determine whether a temporal property is true for every size instance of a system comprised of many homogenous processes.
Book ChapterDOI
Automatic Verification of Parameterized Cache Coherence Protocols
TL;DR: With this application, it is shown that symbolic model checking tools originally designed for hybrid and concurrent systems can be applied successfully to a new class of infinite-state systems of practical interest.
Proceedings ArticleDOI
Sketching stencils
Armando Solar-Lezama,Gilad Arnold,Liviu Tancau,Rastislav Bodik,Vijay Saraswat,Sanjit A. Seshia +5 more
TL;DR: This paper develops a sketching synthesizer that works for stencil computations, a large class of programs that, unlike circuits, have unbounded inputs and outputs, as well as an unbounded number of computations.
References
More filters
Proceedings ArticleDOI
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
Patrick Cousot,Radhia Cousot +1 more
TL;DR: In this paper, the abstract interpretation of programs is used to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations.
Book
An efficient algorithm for exploiting multiple arithmetic units
TL;DR: In this article, the authors describe the methods employed in the floating-point area of the System/360 Model 91 to exploit the existence of multiple execution units and register tagging schemes.
Journal ArticleDOI
An efficient algorithm for exploiting multiple arithmetic units
TL;DR: The methods employed in the floating-point area of the System/360 Model 91 to exploit the existence of multiple execution units are described, which permits simultaneous execution of independent instructions while preserving the essential precedences inherent in the instruction stream.
Book ChapterDOI
Automatic verification of Pipelined Microprocessor Control
Jerry R. Burch,David L. Dill +1 more
TL;DR: The method handles more complicated designs, and requires less human intervention, than existing methods, and results from an efficient validity checker for a logic of uninterpreted functions with equality.
Journal ArticleDOI
Better Verification Through Symmetry
C. Norris Ip,David L. Dill +1 more
TL;DR: This work provides a proof of the soundness of the new symmetry-based verification algorithm based on a definition of the formal semantics of a simple description language with scalarsets, and leads to an alternative characterization of data independence.