Scalable exploration of functional dependency by interpolation and incremental SAT solving

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2007, Pages 227-233

  Lee, Chih Chun ^a   Jiang, Jie Hong R ^a   Huang, Chung Yang ^a   Mishchenko, Alan ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN;

COMPUTER-AIDED DESIGN; FUNCTIONAL DEPENDENCIES; INTERNATIONAL CONFERENCES; SAT SOLVING;

BOOLEAN FUNCTIONS;

EID: 50249153650     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2007.4397270     Document Type: Conference Paper

References (26)

1. J.-H. R. Jiang and R. K. Brayton. Functional dependency for verification reduction. In Proc. CA V, pp. 268-280, 2004.
2. E. Sentovich, H. Toma, and G. Berry. Latch optimization in circuits generated from high-level descriptions. In Proc. ICCAD, pp. 428-435, 1996.
3. B. Lin and A. R. Newton. Exact redundant state registers removal based on binary decision diagrams. In Proc. Int'l Conf. Very Large Scale integration, pp. 277-286, 1991.
4. V. Kravets and P. Kudva. Implicit enumeration of structural changes in circuit optimization. In Proc. DAC, pp. 438-441,2004.
5. A. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In Proc. DAC, pp. 266-271, 1993.
6. C. Berthet, O. Coudert, and J.-C. Madre. New ideas on symbolic manipulations of finite state machines. In Proc. ICCD, pp. 224-227, 1990.
7. C. A. J. van Eijk and J. A. G. Jess. Exploiting functional dependencies in finite state machine verification. In Proc. European Design & Test Conf., pp. 9-14, 1996.
8. E. Gregoire, R. Ostrowski, B. Mazure, and L. Sais. Automatic extraction of functional dependencies. In Proc. SAT, 2004.
9. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, pp. 677-691, August 1986.
10. M. Moskewicz, C. Madigan, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. DAC, pp. 530-535, 2001.
11. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT, pp. 502-518, 2003.
12. A. Mishchenko and R. Brayton. SAT-based complete don't-care computation for network optimization. In Proc. DA TE, pp. 418-423, 2005.
13. A. Mishchenko, J. Zhang, S. Sinha, J. Burch, R.K. Brayton, and M. Chrzanowska-Jeske. Using simulation and satisfiability to compute flexibilities in Boolean networks. IEEE Trans. on CAD, vol. 25, no. 5, pp. 742-755, 2006.
14. W. Craig. Linear reasoning: A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic, 22(3):250-268, 1957.
15. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
16. J. Krajicek. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic, 62(2):457-486, June 1997.
17. P. Pudlak. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbolic Logic, 62(3):981-998, September 1997.
18. K. L. McMillan. Interpolation and SAT-based model checking. In Proc. CAV, pp. 1-13, 2003.
19. G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, pp. 466-483, 1970.
20. D. Plaisted and S. Greenbaum. A structure preserving clause form translation. J. Symbolic Computation, vol. 2, pp. 293-304, 1986.
21. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In Proc. DAC, 2001.
22. R. Jhala and K.L. McMillan, "Interpolant-based transition relation approximation". Proc. CA V, pp. 39-51, 2005.
23. Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification. Release 51205. http://www.eecs.berkeley. edu/~alanmi/abc/
24. R. K. Brayton, et al. VIS: a system for verification and synthesis. In Proc. CAV, pp. 428-432, 1996.
25. Y. Novikov and R. Brinkmann. Foundations of Hierarchical SAT-Solving. In Proc. Int'l Workshop on Boolean Problems, 2004.
26. A. Mishchenko, R. Brayton, J.-H. R. Jiang, and S. Jang. SAT-based logic optimization and resynthesis. In Proc. IWLS, pp. 358-364, 2007.