Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs

Authors:
Daniel Kroening;Natasha Sharygina
Affiliations:
ETH Zurich;University of Lugano
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2007

Citing 15
Cited 2

Model checking and abstraction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Model checking

Model checking
Formal property verification by abstraction refinement with formal, simulation and hybrid engines

Proceedings of the 38th annual Design Automation Conference
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
On Solving Presburger and Linear Arithmetic with SAT

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th 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
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic abstraction and verification of verilog models

Proceedings of the 41st annual Design Automation Conference
Word level predicate abstraction and refinement for verifying RTL verilog

Proceedings of the 42nd annual Design Automation Conference
Interpolant-based transition relation approximation

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Approximating predicate images for bit-vector logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A practical and complete approach to predicate refinement

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Hybrid CEGAR: combining variable hiding and predicate abstraction

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Tighter integration of BDDs and SMT for predicate abstraction

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automated abstraction is the enabling technique for model checking large circuits. Predicate Abstraction is one of the most promising abstraction techniques. It relies on the efficient computation of predicate images and the right choice of predicates. Existing algorithms use a net-list-level circuit model for computing predicate images. 1) This paper describes a proof-based algorithm that computes an over-approximation of the predicate image at the word-level, and thus, scales to larger circuits. 2) The previous work relies on the computation of the weakest preconditions in order to refine the set of predicates. In contrast to that, we propose to extract predicates from a word-level proof to refine the set of predicates.