Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic

Authors:
Hiroaki Shimizu;Kiyoharu Hamaguchi;Toshinobu Kashiwabara
Affiliations:
Graduate School of Information Science & Technology, Osaka University, Osaka, Japan 560-8531;Graduate School of Information Science & Technology, Osaka University, Osaka, Japan 560-8531;Graduate School of Information Science & Technology, Osaka University, Osaka, Japan 560-8531
Venue:
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Year:
2008

Citing 12
Cited 0

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking

Model checking
Symbolic Model Checking

Symbolic Model Checking
Multiway Decision Graphs for Automated Hardware Verification

Formal Methods in System Design
Verification Using Uninterpreted Functions and Finite Instantiations

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Symbolic Checking of Signal-Transition Consistency for Verifying High-Level Designs

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The eureka tool for software model checking

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence Constraints

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to verify larger and more complicated systems with model checking, it is necessary to apply some abstraction techniques. Using a subset of first-order logic, called EUF, is one of them. The EUF model checking problem is, however, generally undecidable. In this paper, we introduce a technique called term-height reduction, to guarantee the termination of state enumeration in EUF model checking. This technique generates an over-approximate set of states including all the reachable states. By checking a designated invariant property, we can guarantee whether the invariant property always holds for the design, when verification succeeds. We apply our algorithm to a simple C program and a DSP design and show the experimental results.