Abstract BDDs: A Technque for Using Abstraction in Model Checking

Authors:
Edmund M. Clarke;Somesh Jha;Yuan Lu;Dong Wang
Affiliations:
-;-;-;-
Venue:
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Year:
1999

Citing 13
Cited 5

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of the Futurebus+ cache coherence protocol

Formal Methods in System Design - Special issue on symbolic model checking
Residue BDD and its application to the verification of arithmetic circuits

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Using partial-order methods in the formal validation of industrial concurrent programs

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Better verification through symmetry

Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking

Formal Methods in System Design - Special issue on symmetry in automatic verification
Symmetry and model checking

Formal Methods in System Design - Special issue on symmetry in automatic verification
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
Symbolic Model Checking

Symbolic Model Checking
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Modular Verification of Multipliers

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Equivalence checking using abstract BDDs

ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)

Verifying Transaction Ordering Properties in Unbounded Bus Networks through Combined Deductive/Algorithmic Methods

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Verification of Embedded Software: Problems and Perspectives

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Incremental Proof of the Producer/Consumer Property for the PCI Protocol

ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Model Checking with Formula-Dependent Abstract Models

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Searching for Mutual Exclusion Algorithms Using BDDs

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new methodology for exploiting abstraction in the context of model-checking. Our new technique uses abstract BDDs as its underlying data structure. We show that this technique builds a more refined model than traditional compiler-based methods proposed by Clarke, Grumberg and Long. We also provide experimental results to demonstrate the usefulness of our method. We have verified a pipelined carry-save multiplier and a simple version of the PCI local bus protocol. Our verification of the PCI bus revealed a subtle inconsistency in the PCI standard. We believe this is an interesting result by itself.