Practical applications of boolean satisfiability

Proceedings - 9th International Workshop on Discrete Event Systems, WODES' 08

Volumn , Issue , 2008, Pages 74-80

  Marques Silva, Joao ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; BOOLEAN ALGEBRA; EMBEDDED SYSTEMS; TECHNICAL PRESENTATIONS;

BOOLEAN SATISFIABILITY; CROSS-TALK NOISE; DISCRETE EVENT SYSTEMS; MAXIMUM SATISFIABILITY; MODERN APPLICATIONS; PSEUDO-BOOLEAN CONSTRAINTS; QUANTIFIED BOOLEAN FORMULAE; SAT SOLVERS; TERM-REWRITE SYSTEMS; TERMINATION ANALYSIS;

BOOLEAN FUNCTIONS;

EID: 53149106258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2008.4605925     Document Type: Conference Paper

References (57)

1. P. A. Abdulla, P. Bjesse, and N. Een, "Symbolic reachability analysis based on SAT solvers," in Tools and Algorithms for the Construction and Analysis of Systems, 2000.
2. M. Abramovici, M. A. Breuer, and A. D. Friedman, Digital Systems Testing and Testable Design. Computer Science Press, 1990.
3. H. R. Andersen and H. Hulgaard, "Boolean expression diagrams (extended abstract)," in Logic in Computer Science, 1997, pp. 88-98.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani, "A SAT based approach for solving formulas over Boolean and linear mathematical propositions," in International Conference on Automated Deduction, 2002, pp. 195-210.
5. O. Bailleux, Y. Boufkhad, and O. Roussel, "A translation of pseudo Boolean constraints to SAT," Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, March 2006.
6. P. Barth, "A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization," Max Plank Institute for Computer Science, Tech. Rep. MPI-I-95-2-003, 1995.
7. A. Biere, A. Cimatti, E. Clarke, O. Strichman, and Y. Zhu, Advances in Computers, Academic Press, 2003, ch. Bounded Model Checking.
8. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in Tools and Algorithms for the Construction and Analysis of Systems, March 1999, pp. 193-207.
9. D. Brand, "Verification of large synthesized designs," in International Conference on Computer-Aided Design, 1993, pp. 534-537.
10. P. Chen and K. Keutzer, "Towards true crosstalk noise analysis," in International Conference on Computer-Aided Design, November 1999, pp. 132-138.
11. A. Cimatti, "Satisfiability modulo theories," in Special Session on SAT at WODES08, 2008.
12. K. Claessen, N. Een, M. Sheeran, and N. Sörensson, "SAT-solving in practice," in Special Session on SAT at WODES08, 2008.
13. E. M. Clarke, O. Grumberg, and A. Peled, Model Checking. MIT Press, 1999.
14. E. M. Clarke, D. Kroening, and F. Lerda, "A tool for checking ANSI-C programs," in Tools and Algorithms for the Construction and Analysis of Systems, 2004, pp. 168-176.
15. S. Cook, "The complexity of theorem proving procedures," in Proceedings of the Third Annual Symposium on Theory of Computing, 1971, pp. 151-158.
16. A. Darwiche, "New advances in compiling CNF into decomposable negation normal form," in European Conference on Artificial Intelligence, 2004, pp. 328-332.
17. N. Dershowitz, Z. Hanna, and J. Katz, "Bounded model checking with QBF," in International Conference on Theory and Applications of Satisfiability Testing, 2005, pp. 408-414.
18. N. Een and N. Sörensson, "An extensible SAT solver," in International Conference on Theory and Applications of Satisfiability Testing, May 2003, pp. 502-518.
19. -, "Translating pseudo-Boolean constraints into SAT," Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, March 2006.
20. Z. Fu and S. Malik, "On solving the partial MAX-SAT problem," in International Conference on Theory and Applications of Satisfiability Testing, August 2006, pp. 252-265.
21. C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl, "SAT solving for termination analysis with polynomial interpretations," in International Conference on Theory and Applications of Satisfiability Testing, 2007, pp. 340-354.
22. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "DPLL(T): Fast decision procedures," in Computer-Aided Verification, 2004, pp. 175-188.
23. D. Gusfield and S. Orzach, Handbook on Computational Molecular Biology, CRC Press, December 2005, vol. 9, ch. Haplotype Inference.
24. F. Heras, J. Larrosa, and A. Oliveras, "MiniMaxSat: a new weighted Max-SAT solver," in International Conference on Theory and Applications of Satisfiability Testing, May 2007, pp. 41-55.
25. D. Jackson, I. Schechter, and I. Shlyakhter, "Alcoa: the Alloy constraint analyzer," in International Conference on Software Engineering, 2000, pp. 730-733.
26. S. Khurshid and D. Marinov, "TestEra: Specification-based testing of Java programs using SAT," Autom. Softw. Eng., vol. 11, no. 4, pp. 403-434, 2004.
27. H. Kleine-Büning and T. Lettman, Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999.
28. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai, "Robust Boolean reasoning for equivalence checking and functional property verification," IEEE Transactions on Computer-Aided Design, vol. 21, no. 12, 2002.
29. G. Lancia, C. M. Pinotti, and R. Rizzi, "Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms," INFORMS Journal on Computing, vol. 16, no. 4, pp. 348-359, 2004.
30. T. Larrabee, 'Test pattern generation using Boolean satisfiability," IEEE Transactions on Computer-Aided Design, vol. 11, no. 1, pp. 4-15, January 1992.
31. C.-C. Lee, J.-H. R. Jiang, C.-Y. Huang, and A. Mishchenko, "Scalable exploration of functional dependency by interpolation and incremental SAT solving," in International Conference on Computer-Aided Design, 2007, pp. 227-233.
32. R. Letz, "Lemma and model caching in decision procedures for quantified Boolean formulas," in International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, July 2002, pp. 160-175.
33. C. M. Li, F. Manyà, and J. Planes, "New inference rules for Max-SAT," Journal of Artificial Intelligence Research, vol. 30, pp. 321-359, 2007.
34. I. Lynce and J. Marques-Silva, "Efficient haplotype inference with Boolean satisfiability," in National Conference on Artificial Intelligence, July 2006.
35. P. Manolios, M. G. Oms, and S. O. Valls, "Checking pedigree consistency with PCS," in Tools and Algorithms for the Construction and Analysis of Systems, 2007, pp. 339-342.
36. V. Manquinho and J. Marques-Silva, "Search pruning conditions for Boolean optimization," in European Conference on Artificial Intelligence, August 2000, pp. 130-107.
37. J. Marques-Silva and T. Glass, "Combinational equivalence checking using satisfiability and recursive learning," in Design, Automation and Test in Europe Conference, March 1999, pp. 145-149.
38. J. Marques-Silva and K. Sakallah, "GRASP: A new search algorithm for satisfiability," in International Conference on Computer-Aided Design, November 1996, pp. 220-227.
39. -, "Robust search algorithms for test pattern generation," in IEEE Fault-Tolerant Computing Symposium, June 1997, pp. 152-161.
40. J. Marques-Silva and J. Planes, "Algorithms for maximum satisfiability using unsatisfiable cores," in Design, Automation and Testing in Europe Conference, March 2008.
41. P. C. McGeer, A. Saldanha, P. R. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli, "Timing analysis and delay-fault test generation using path-recursive functions," in International Conference on Computer-Aided Design, 1991, pp. 180-183.
42. K. L. McMillan, Symbolic Model Checking. Kluwer Academic Publishers, 1993.
43. -, "Interpolation and SAT-based model checking," in Computer-Aided Verification, 2003, pp. 1-13.
44. M. Moskewicz, C. Madigan, Y Zhao, L. Zhang, and S. Malik, "Engineering an efficient SAT solver," in Design Automation Conference, June 2001, pp. 530-535.
45. D. A. Plaisted and S. Greenbaum, "A structure-preserving clause form translation," Journal of Symbolic Computation, vol. 2, no. 3, pp. 293-304, September 1986.
46. J. Rintanen, K. Heljanko, and I. Niemelä, "Planning as satisfiability: parallel plans and algorithms for plan search," Artificial Intelligence, vol. 170, no. 12-13, pp. 1031-1080, 2006.
47. S. Safarpour, A. G. Veneris, G. Baeckler, and R. Yuan, "Efficient SAT-based Boolean matching for FPGA technology mapping," in Design Automation Conference, 2006, pp. 466-471.
48. T. Sang, P. Beame, and H. A. Kautz, "Heuristics for fast exact model counting," in International Conference on Theory and Applications of Satisfiability Testing, 2005, pp. 226-240.
49. B. Selman and H. Kautz, "Planning as satisfiability," in European Conference on Artificial Intelligence, 1992, pp. 359-363.
50. M. Sheeran, S. Singh, and G. Stalmarck, "Checking safety properties using induction and a SAT solver," in Formal Methods in Computer-Aided Design, 2000, pp. 108-125.
51. C. Sinz, "Towards an optimal CNF encoding of Boolean cardinality constraints," in International Conference on Principles and Practice of Constraint Programming, October 2005, pp. 827-831.
52. A. Smith, A. G. Veneris, M. F. Ali, and A. Viglas, "Fault diagnosis and logic debugging using Boolean satisfiability," IEEE Transactions on Computer-Aided Design, vol. 24, no. 10, pp. 1606-1621, 2005.
53. P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli, "Combinational test generation using satisfiability," IEEE Transactions on Computer-Aided Design, vol. 15, no. 9, pp. 1167-1176, September 1996.
54. G. S. Tseitin, "On the complexity of derivation in propositional calculus," Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 115-125, 1968.
55. C. Tucker, D. Shuffelton, R. Jhala, and S. Lerner, "OPIUM: Optimal package install/uninstall manager," in International Conference on Software Engineering, 2007, pp. 178-188.
56. T. Walsh, "SAT v CSP," in International Conference on Principles and Practice of Constraint Programming, September 2000, pp. 441-456.
57. J. P. Warners, "A linear-time transformation of linear inequalities into conjunctive normal form," Information Processing Letters, vol. 68, no. 2, pp. 63-69, 1998.