SAT-based complete don't-care computation for network optimization

Proceedings -Design, Automation and Test in Europe, DATE '05

Volumn I, Issue , 2005, Pages 412-417

  Mishchenko, Alan ^a   Brayton, Robert K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN NETWORKS; COMPATIBLE OBSERVABILITY; INDUSTRIAL NETWORKS; NETWORK OPTIMIZATION;

ALGORITHMS; BENCHMARKING; BOOLEAN ALGEBRA; INDUSTRIAL APPLICATIONS; ROBUSTNESS (CONTROL SYSTEMS); SYSTEMS ANALYSIS;

COMPUTATION THEORY;

EID: 33646941314     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.264     Document Type: Conference Paper

References (25)

1. D. Brand. Verification of large synthesized designs. Proc. ICCAD '93, pp. 534-537.
2. R. K. Brayton. Compatible observability don't-cares revisited. Proc. IWLS '01. pp. 121-126.
3. N. Eén, N. Sörensson. An extensible SAT-solver. Proc. SAT '03. http://www.cs.chalmers.se/~een/Satzoo/ An_Extensible_SAT-solver.ps.gz
4. E. Goldberg, M.Prasad, R.K.Brayton. Using SAT for combinational equivalence checking. Proc. DATE '01, pp. 114 -121. http://eigold.tripod.com/
5. ITC '99 Benchmarks http://www.cad.polito.it/tools/itc99.html
6. F. Lu, L. Wang, K. Cheng, R. Huang. A circuit SAT solver with signal correlation guided learning. Proc. DATE '03, pp. 892-897.
7. Y. Jiang, R. K. Brayton. Don't-cares and multi-valued logic network optimization. Proc. ICCAD'00, pp. 520-525. http://www-cad.eecs.berkeley.edu/ Respep/Research/mvsis/
8. A. Kuehlmann, V. Paruthi, F. Krohm, M. K. Ganai. Robust Boolean reasoning for equivalence checking and functional property verification. IEEE Trans. CAD, Vol. 21, No. 12, December 2002, pp. 1377-1394.
9. J. P. Marques-Silva, K. A. Sakallah, GRASP: A search algorithm for prepositional satisfiability, IEEE Trans. Comp, vol. 48, no. 5, pp. 506-521, May 1999.
10. K. McMillan. Applying SAT methods in unbounded symbolic model checking. Proc. CAV '02, LNCS, vol. 2404, pp. 250-264.
11. A. Mishchenko, R. K. Brayton. Simplification of non-deterministic multi-valued networks. Proc. ICCAD '02, pp. 557-562.
12. A. Mishchenko, R. K. Brayton. A theory of non-deterministic networks. Proc. ICCAD '03, pp. 709-716.
13. A. Mishchenko, X. Wang, T. Kam. A new enhanced constructive decomposition and mapping algorithm. Proc. DAC '03, pp. 143-148.
14. A. Mishchenko, R. K. Brayton. SAT-based complete don't-care computation for network optimization. Proc. IWLS '04, pp. 353-360.
15. A. Mishchenko. EXTRA library of the DD procedures. http://www.ee.pdx.edu/ ~alanmi/research/extra.htm
16. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: engineering an efficient SAT solver. Proc. DAC '01, pp. 530-535.
17. SUN Microelectronics. PicoJava Microprocessor Cores. http://www.sun.com/ microelectronics/picoJava/
18. F. Somenzi. BDD package "CUDD v. 2.3.0." http://vlsi.colorado. edu/~fabio/CUDD/cuddIntro.html
19. MVSIS Group. MVSIS. UC Berkeley. http://www-cad.eecs.berkeley.edu/mvsis/
20. H. Savoj, R. K. Brayton. The use of observability and external don't-cares for the simplification of multi-level networks. Proc. DAC' 90. pp. 297-301.
21. H. Savoj. Improvements in technology independent optimization of logic circuits. Proc, IWLS '97.
22. H. Savoj. Don't cares in multi-level network optimization, Ph.D. Dissertation, UC Berkeley, May 1992.
23. N. Saluja, S. P. Khatri, A robust algorithm for approximate compatible observability don't care computation, Proc. DAC '04, pp. 422-427.
24. E. Sentovich et al. SIS: A system for sequential circuit synthesis. Tech. Rep. UCB/ERI, M92/41, ERL, Dept. of EECS, UC Berkeley, 1992.
25. S. Yang. Logic synthesis and optimization benchmarks. Version 3.0. Tech. Report. Microelectronics Center of North Carolina, 1991.