Using higher levels of abstraction for solving optimization problems by Boolean Satisfiability

Proceedings - IEEE Computer Society Annual Symposium on VLSI: Trends in VLSI Technology and Design, ISVLSI 2008

Volumn , Issue , 2008, Pages 411-416

  Wille, Robert ^a   Große, Daniel ^a   Soeken, Mathias ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN ALGEBRA; EMBEDDED SYSTEMS; ENCODING (SYMBOLS); OPTIMIZATION; TECHNOLOGY;

BOOLEAN SATISFIABILITY; CASE STUDIES; DECISION PROBLEMS; ENCODINGS; EXACT SYNTHESIS; GRAPH COLORINGS; LEVELS OF ABSTRACTION; MODULO THEORIES; OPTIMIZ ATION PROBLEMS; PROBLEM INSTANCES; REVERSIBLE LOGICS; RUN-TIME; SYNTHESIS PROBLEMS; VLSI TECHNOLOGIES; WORD LEVEL;

BOOLEAN FUNCTIONS;

EID: 51849091482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVLSI.2008.82     Document Type: Conference Paper

References (27)

1. The Satisfiability Modulo Theories Competition (SMT-COMP) . www.smtcomp.org, 2007.
2. A. Armando, J. Mantovani, and L. Platania. Bounded model checking of software using SMT solvers instead of SAT solvers. In SPIN, pages 146-162, 2006.
3. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. Rossum, S. Schulz, and R. Sebastiani. The MathSAT 3 System. In Int. Conf. on Automated Deduction, 2005.
4. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. Comm. of the ACM, 5:394-397, 1962.
5. S. Deng, J. Bian, W. Wu, X. Yang, and Y. Zhao. EHSAT: An efficient rtl satisfiability solver using an extended dpll procedure. In Design Automation Conf., pages 588-593, 2007.
6. R. Drechsler. Using word-level information in formal hardware verification. Automation and Remote Control, 65(4):963-977, 2004.
7. B. Dutertre and L. Moura. A Fast Linear-Arithmetic Solver for DPLL(T). In Computer Aided Verification, volume 4114 of LNCS, pages 81-94, 2006.
8. N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
9. V. Ganesh and D. L. Dill. A decision procedure for bit-vectors and arrays. In Computer Aided Verification, volume 4590, pages 519-531, 2007.
10. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Design, Automation and Test in Europe, pages 142-149, 2002.
11. D. Große, X. Chen, G. Dueck, and R. Drechsler. Exact SAT-based Toffoli network synthesis. In Great Lakes Symp. VLSI, pages 96-101, 2007.
12. C. Haubelt, J. Teich, R. Feldmann, and B. Monien. SAT-based techniques in system synthesis. In Design, Automation and Test in Europe, pages 11168-11169, 2003.
13. D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM, New York, NY, USA, 1993.
14. S. K. Lahiri, R. Nieuwenhuis, and A. Oliveras. Smt techniques for fast predicate abstraction. In Computer Aided Verification, volume 4144, pages 424-437. Springer, 2006.
15. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. on Comp., 48(5):506-521, 1999.
16. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., pages 530-535, 2001.
17. R. Nieuwenhuis and A. Oliveras. On SAT modulo theories and optimization problems. In SAT, volume 4121, pages 156-169. Springer, 2006.
18. S. Ranise and C. Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 2006.
19. L. Ryan. Efficient Algorithms for Clause Learning SAT Solvers. Master's thesis, Simon Fraser University, Canada, 2004.
20. A. Sülflow, U. Kühne, R. Wille, D. Große, and R. Drechsler. Evaluation of SAT like proof techniques for formal verification of word level circuits. In IEEE 8th Workshop on RTL and High Level Testing (WRTLT'07), pages 31-36, 2007.
21. T. Toffoli. Reversible computing. In Proceedings of the 7th Colloquium on Automata, Languages and Programming, pages 632-644, London, UK, 1980. Springer-Verlag.
22. G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2, pages 115-125, 1968. (Reprinted in: J. Siekmann, G. Wrightson (Ed.), Automation of Reasoning, Vol. 2, Springer, Berlin, 1983, pp. 466-483.).
23. M. N. Velev. Exploiting hierarchy and structure to efficiently solve graph coloring as SAT. In Int'l Conf. on CAD, pages 135-142, 2007.
24. R. Wille, G. Fey, D. Große, S. Eggersglüß, and R. Drechsler. Sword: A SAT like prover using word level information. In Int'l Conf. on Very Large Scale Integration, pages 88-93, 2007.
25. R. Wille and D. Große. Fast Exact Toffoli Network Synthesis of Reversible Logic. In Int'l Conf. on CAD, pages 60-64, 2007.
26. R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drech-sler. RevLib: an online resource for reversible functions and reversible circuits. In Int'l Symp. on Multi-Valued Logic, 2008. RebLiv is available at http://www.revlib.org.
27. Z. Zeng, K. R. Talupuru, and M. J. Ciesielski. Functional test generation based on word-level SAT. Journal of Systems Architecture, 51(8):488-511, 2005.