Predicate abstraction of RTL verilog descriptions using constraint logic programming

Authors:
Tun Li;Yang Guo;SiKun Li;GongJie Liu
Affiliations:
National University of Defense Technology, ChangSha, HuNan, China;National University of Defense Technology, ChangSha, HuNan, China;National University of Defense Technology, ChangSha, HuNan, China;National University of Defense Technology, ChangSha, HuNan, China
Venue:
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Year:
2005

Citing 12
Cited 0

Model checking

Model checking
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Automatically validating temporal safety properties of interfaces

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Test Synthesis with Alternative Graphs

IEEE Design & Test
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Modular Verification of Software Components in C

IEEE Transactions on Software Engineering
Predicate Abstraction of ANSI-C Programs Using SAT

Formal Methods in System Design
Functional Vectors Generation for RT-Level Verilog Descriptions Based on Path Enumeration and Constraint Logic Programming

DSD '05 Proceedings of the 8th Euromicro Conference on Digital System Design
Software verification with BLAST

SPIN'03 Proceedings of the 10th international conference on Model checking software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A major technique to address state explosion problem in model checking is abstraction. Predicate abstraction has been applied successfully to large software and now to hardware descriptions, such as Verilog. This paper evaluates the state-of-the-art constraint logic programming (CLP) techniques to improve the performance of predication abstraction of hardware designs, and compared it with the SAT-based predicate abstraction techniques. With CLP based techniques, we can model various constraints, such as bit, bit-vector and integer, in a uniform framework; we can also model the word-level constraints without flatting them into bit-level constraints as SAT-based method does. With these advantages, the computation of abstraction system can be more efficient than SAT-based techniques. We have implemented this method, and the experimental results have shown the promising improvements on the performance of predicate abstraction of hardware designs.