Abstract BDDs: A technique for using abstraction in model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1703, Issue , 1999, Pages 172-187

  Clarke, Edmund ^a   Jha, Somesh ^a   Lu, Yuan ^a   Wang, Dong ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Abstract BDDs; Abstraction; Model checking

Indexed keywords

ABSTRACTING; DESIGN; HARDWARE; RECONFIGURABLE HARDWARE; SYSTEM BUSES;

ABSTRACTION; CARRY-SAVE; LOCAL BUS; PCI BUS; PCI STANDARD; REFINED MODEL;

MODEL CHECKING;

EID: 84867657985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_14     Document Type: Conference Paper

References (17)

1. R. E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Comput., Vol. C-35, No.8, pp.677-691, Aug. 1986.
2. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill, “Symbolic Model Checking for Sequential Circuit Verification”, IEEE Trans. on CAD of Integrated Circuits and System, Vol.13, No.4, pp.401-424, 1994.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finitestate concurrent system using temporal logic”, Proceedings of the Tenth Annual ACM Symposium on Principles of Programming Languages (POPL), January, 1983.
4. E. M. Clarke, R. Enders, T. Filkorn and S. Jha, ”Exploiting Symmetry in Temporal Logic Model Checking”, Formal Methods in System Design 9(1/2):77-104, 1996.
5. E. M. Clarke and O. Grumberg and H. Hiraishi and S. Jha and D. E. Long and K. L. McMillan and L. A. Ness, “Verification of the Futurebus+ Cache Coherence Protocol”, Formal Methods in System Design 6(2):217-232, 1995.
6. E. M. Clarke, O. Grumberg, D. E. Long, “Model Checking and Abstraction”, ACM Transactions on Programming Languages and System (TOPLAS), Vol.16, No.5, pp.1512-1542, Sept. 1994.
7. E. A. Emerson and A. P. Sistla, “Symmetry and Model Checking”, Formal Methods in System Design 9(1/2):105-130, 1996.
8. P. Godefroid, D. Peled, and M. Staskauskas, “Using Partial Order Methods in the Formal Verification of Industrial Concurrent Programs”, ISSTA’96 International Symposium on Software Testing and Analysis, pp.261-269, San Diego, California, USA, 1996. ACM Press.
9. J. L. Hennessy, D. A. Patterson, Computer Architecture: A Quantitative Approach, second edition, 1996. Morgan Kaufman Press.
10. C. N. Ip and D. L. Dill, ”Better Verification Through Symmetry”, Formal Methods in System Design 9(1/2):41-76, 1996.
11. S. Jha, Y. Lu, M. Minea, E. M. Clarke, “Equivalence Checking using Abstract BDDs”, Intl. Conf. on Computer Design (ICCD), 1997.
12. Shinji Kimura, “Residue BDD and Its Application to the Verification of Arithmetic Circuits”, 32nd Design Automation Conference (DAC), 1995.
13. D. E. Long, “Model Checking, Abstraction and Compositional Verification”, School of Computer Science, Carnegie Mellon University publication CMU-CS-93-178, July 1993.
14. K. L. McMillan, “Symbolic Model Checking: An Approach to the State Explosion Problem”. Kluwer Academic Publishers, 1993.
15. D. Peled, “Combining Partial Order Reduction with on-the-fly model-checking”, Journal of Formal Methods in System Design, 8(1):39-64.
16. PCI SGI, “PCI Local Bus Specification”, Production Version Revision 2.1, June 1, 1995.
17. Kavita Ravi, Abelardo Pardo, Gary D. Hachtel, Fabio Somenzi, “Modular Verification of Multipliers”, Formal Methods in Computer-Aided Design, pp.49-63, Nov. 1996.