Efficient verification with BDDs using implicitly conjoined invariants
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Protocol verification as a hardware design aidPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- ATPG aspects of FSM verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for discrete function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implicit state enumeration of finite state machines using BDD'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reducing BDD size by exploiting functional dependenciesPublished by Association for Computing Machinery (ACM) ,1993
- Functional extension of symbolic model checkingLecture Notes in Computer Science, 1992
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Verification of synchronous sequential machines based on symbolic executionLecture Notes in Computer Science, 1990
- Sequential circuit verification using symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986