Applying logic synthesis for speeding up SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4501 LNCS, Issue , 2007, Pages 272-286

  Een, Niklas ^a   Mishchenko, Alan ^a   Sörensson, Niklas ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; HEURISTIC METHODS; PROBLEM SOLVING; PROGRAM PROCESSORS;

LOGIC SYNTHESIS; SAT SOLVER TECHNOLOGY;

FORMAL LOGIC;

EID: 38049132677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_26     Document Type: Conference Paper

References (16)

1. A. Biere. AIGER (AIGER is a format, library and set of utilities for And-Inverter Graphs (AIGs)). http://fmv.jku.at/aiger/.
2. P. Bjesse and A. Boralv. DAG-Aware Circuit Compression For Formal Verification. In Proc. ICCAD'04, 2004.
3. D. Chen and J. Cong. DAOmap: A Depth-Optimal Area Optimization Mapping Algorithm for FPGA Designs. In ICCAD, pages 752-759, 2004.
4. R. Drechsler. Using Synthesis Techniques in SAT Solvers. Technical Report, Intitute of Computer Schience, Unversity of Bremen, 28359 Bremen, Germany, 2004.
5. N. Een. http://www.cs.chalmers.se/~een/SAT-2007.
6. th International Conference (SAT'2005), volume 3569 of LNCS, 2005.
7. N. Een and N. Sörensson. Translating Pseudo-Boolean Constraints into SAT. In Journal on Satisfiability, Boolean Modelling and Computation (JSAT), volume 2 of IOS Press, 2006.
8. B. L. S. Group. ABC: A System for Sequential Synthesis and Verification. http://www.eecs.berkeley.edu/~alanmi/abc/
9. P. Jackson and D. Sheridan. Clause Form Conversions for Boolean Circuits. In Theory and Appl. of Sat. Testing, 7th Int. Conf. (SAT'04), volume 3542 of LNCS, Springer, 2004.
10. S. Minato. Fast Generation of Irredundant Sum-Of-Products Forms from Binary Decision Diagrams. In Proc. SASIMI'92.
11. A. Mishchenko, S. Chatterjee, and R. Brayton. DAG-aware AIG rewriting: A fresh look at combinational logic synthesis. In Proc. DAC'06, pages 532-536, 2006.
12. A. Mishchenko, S. Chatterjee, and R. Brayton. Improvements to Technology Mapping for LUT-based FPGAs. volume 26:2, pages 240-253, February 2007.
13. C. Sinz. SAT-Race 2006 Benchmark Set. http://fmv.jku.at/sat-race- 2006/.
14. G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constr. Math. and Math. Logic, 1968.
15. M. N. Velev. Efficient Translation of Boolean Formulas to CNF in Formal Verification of Microprocessors. Proc. of Conf. on Asia South Pacific Design Aut. (ASP-DAC), 2004.
16. E. Zarpas. Benchmarking SAT Solvers for Bounded Model Checking. In Proc. SAT'05, number 3569 in LNCS. Springer-Verlag, 2005.