Algebraic decision diagrams and their applications
暂无分享,去创建一个
R. I. Bahar | E. Frohm | C. M. Gaona | G. Hachtel | E. Macii | A. Pardo | F. Somenzi | Abelardo Pardo
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.
[3] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[4] Iain S. Duff,et al. Direct methods for sparse matrices27100 , 1986 .
[5] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[6] Olivier Coudert,et al. Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.
[7] Seh-Woong Jeong,et al. ATPG aspects of FSM verification , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[8] Frank M. Brown,et al. Boolean reasoning - the logic of boolean equations , 1990 .
[9] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[10] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[11] Edmund M. Clarke,et al. Sequential circuit verification using symbolic model checking , 1991, DAC '90.
[12] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[13] Enrico Macii,et al. Algorithms for Approximate FSM Traversal , 1993, 30th ACM/IEEE Design Automation Conference.
[14] Masahiro Fujita,et al. Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.
[15] Fabio Somenzi,et al. A Symbolic Algorithms for Maximum Flow in 0-1 Networks , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).