Improved approximate reachability using auxiliary state variables

Authors:
Shankar G. Govindaraju;David L. Dill;Jules P. Bergmann
Affiliations:
Computer Systems Laboratory, Stanford University, Stanford, CA;Computer Systems Laboratory, Stanford University, Stanford, CA;Computer Systems Laboratory, Stanford University, Stanford, CA
Venue:
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Year:
1999

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The Stanford FLASH multiprocessor

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Approximate reachability with BDDs using overlapping projections

DAC '98 Proceedings of the 35th annual Design Automation Conference
Verification by approximate forward and backward reachability

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Automatic state space decomposition for approximate FSM traversal based on circuit analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithms for approximate FSM traversal based on state space decomposition

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Hi-index	0.00