Node mergers in the presence of don't cares

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2007, Pages 414-419

  Plaza, Stephen M ^a   Chang, Kai Hui ^a   Markov, Igor L ^a   Bertacco, Valeria ^a  

^a University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; (E ,3E) PROCESS; CIRCUIT SIZE; CURRENT STATE; DESIGN AUTOMATION CONFERENCE (DAC); EQUIVALENCE CHECKING; EQUIVALENCE RELATIONS; NET LIST; OBSERVABILITY DON'T CARES (ODC); POST SYNTHESIS; RUN TIME; SAT SWEEPING; SOUTH PACIFIC; SYNTHESIS (OF CHIRAL IONIC LIQUIDS); TECHNOLOGY-MAPPING; VERIFICATION STRATEGY;

BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS; EQUIVALENCE CLASSES; GLOBAL OPTIMIZATION; INDUSTRIAL ENGINEERING; MECHANIZATION; OPTIMIZATION; SET THEORY;

MERGING;

EID: 46649118877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2007.358021     Document Type: Conference Paper

References (17)

1. Berkeley Logic Synthesis and Verification Group, "ABC: a system for sequential synthesis and verification", http://www.eecs.berkeley.edu/ ~alanmi/abc/.
2. D. Brand, "Verification of large synthesized designs", ICCAD '93, pp. 534-537.
3. N. Een and N. Sorensson, "An extensible SAT-solver", SAT '03, http://www.cs.chalmers.se/~een/Satzoo.
4. G. DeMicheli and M. Damiani, "Synthesis and optimization of digital circuits", McGraw-Hill '94.
5. Z. Fu, Y. Yu, and S. Malik, "Considering circuit observability don't cares in CNF satisfiability", DATE '05, pp. 1108-1113.
6. E. Goldberg, M. Prasad, and R. Brayton, "Using SAT for combinational equivalence checking", DATE '01, pp. 114-121.
7. A. Kuehlmann, V. Paruthi, F. Krohm, and M. Ganai, "Robust Boolean reasoning for equivalence checking and functional property verification", IEEE Trans. CAD '02, pp. 1377-1394.
8. F. Lu, L.-C. Wang, K.-T. Cheng, J. Moondanos, and Z. Hanna, "A signal correlation guided circuit-SAT solver", J. UCS 10(12) '04, pp. 1629-1654.
9. A. Mishchenko, S. Chatterjee, and R. Brayton, "DAG-aware AIG rewriting: A fresh look at combinational logic synthesis", DAC '06, pp. 532-536.
10. A. Mishchenko, S. Chatterjee, R. Jiang, and R. Brayton, "FRAIGs: A unifying representation for logic synthesis and verification", ERL Technical Report, Berkeley, http://www.eecs.berkeley.edu/~alanmi/ publications/.
11. A. Mishchenko and R. Brayton, "SAT-based complete don't care computation for network optimization", DATE '05, pp. 412-417.
12. A. Mishchenko et al, "Using simulation and satisfiability to compute flexibilities in Boolean networks", TCAD '06, pp. 743-755.
13. N. Saluja and S. Khatri, "A robust algorithm for approximate compatible observability don't care computation", DAC '04, pp. 422-427.
14. H. Savoj and R. Brayton, "The use of observability and external don't-cares for the simplification of multi-level networks", DAC '90, pp. 297-301.
15. J. Marques-Silva and K. Sakallah, "GRASP: A search algorithm for prepositional satisfiability", IEEE Trans. Comp '99, pp. 506-521.
16. http://iwls.org/iwls2005/benchmarks.html.
17. Q. Zhu, N. Kitchen, A. Kuehlmann, and A. Sangiovanni-Vincentelli, "SAT sweeping with local observability don't cares", DAC '06, pp. 229-234.