Using cutwidth to improve symbolic simulation and Boolean satisfiability
暂无分享,去创建一个
[1] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.
[2] David Fernández-Baca. Nonserial Dynamic Programming Formulations of Satisfiability , 1988, Inf. Process. Lett..
[3] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .
[4] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.
[5] Igor L. Markov,et al. Faster SAT and smaller BDDs via common function structure , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[6] C. Leonard Berman,et al. Circuit width, register allocation, and ordered binary decision diagrams , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] Randal E. Bryant,et al. Symbolic simulation—techniques and applications , 1990, DAC '90.
[8] Brian W. Kernighan,et al. A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] In-Ho Moon,et al. Border-Block Triangular Form and Conjunction Schedule in Image Computation , 2000, FMCAD.
[10] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[11] Kurt Keutzer,et al. Why is ATPG easy? , 1999, DAC '99.
[12] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[13] Shashi Shekhar,et al. Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..