A new algorithm for the binate covering problem and its application to the minimization of Boolean relations

Authors:
Seh-Woong Jeong;Fabio Somenzi
Affiliations:
Department of Electric and Computer Engineering, University of Colorado at Boulder;Department of Electric and Computer Engineering, University of Colorado at Boulder
Venue:
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Year:
1992

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Verification of synchronous sequential machines based on symbolic execution

Proceedings of the international workshop on Automatic verification methods for finite state systems
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
An iterative algorithm for the binate covering problem

EURO-DAC '90 Proceedings of the conference on European design automation
Exact and heuristic algorithms for the minimization of incompletely specified state machines

EURO-DAC '91 Proceedings of the conference on European design automation

Optimization of combinational logic circuits based on compatible gates

DAC '93 Proceedings of the 30th international Design Automation Conference
Arithmetic Boolean Expression Manipulator Using BDDs

Formal Methods in System Design
A recursive paradigm to solve Boolean relations

Proceedings of the 41st annual Design Automation Conference
Functional test generation based on word-level SAT

Journal of Systems Architecture: the EUROMICRO Journal

Hi-index	0.00