Work

Model checking and abstraction

Year: 1992

Type: conference-paper

Abstract: We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method is a way of constructing an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original program. We have implemented a system based on these techniques, and we demonstrate their practicality using a number of examples, including a pipelined ALU circuit with over 101300 states.

Source: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

DOI: 10.1145/143165.143235

Authors: Edmund M. Clarke, Orna Grumberg, David E. Long

Institutions: Carnegie Mellon University, Technion – Israel Institute of Technology, AT&T (United States)

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, U.S. Air Force, Advanced Research Projects Agency

Award: Temporal Logic, Hardware Verification, and Parallel Theorem Proving