Optimizations for compiling declarative models into boolean formulas

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 187-202

  Marinov, Darko ^a   Khurshid, Sarfraz ^b   Bugrara, Suhabe ^c   Zhang, Lintao ^d   Rinard, Martin ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b The University of Texas at Austin   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM COMPILERS; SEMANTICS;

BOOLEAN FORMULAS; DECLARATIVE MODELS; LOGIC FORMULAS; REASONING PROBLEMS;

PROBLEM SOLVING;

EID: 26444485956     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_14     Document Type: Conference Paper

References (27)

1. William Adjie-Winoto, Elliot Schwartz, Hari Balakrishnan, and Jeremy Lilley. The design and implementation of an intentional naming system. In Proc. 17th ACM Symposium on Operating Systems Principles (SOSP), Kiawah Island, December 1999.
2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1988.
3. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Masahiro Fujita, and Yunshan Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. 36thConference on Design Automation (DAC), New Orleans, LA, June 1999.
4. Edmund Clarke, Daniel Kroening, and Flavio Lerda. A tool for checking ANSI-C programs. In Kurt Jensen and Andreas Podelski, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), volume 2988 of Lecture Notes in Computer Science, pages 168-176. Springer, 2004.
5. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
6. Jonathan Edwards, Daniel Jackson, Emina Torlak, and Vincent Yeung. Faster constraint solving with subtypes. In Proc. International Symposium on Software Testing and Analysis (ISSTA), July 2004.
7. Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic SAT-compilation of planning problems. In IJCAI-97, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 1169-1176, Nagoya, Japan, August 1997.
8. Malay K. Ganai, Lintao Zhang, Pranav Ashar, Aarti Gupta, and Sharad Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In Proc. 39thConference on Design Automation (DAC), pages 747-750, June 2002.
9. Daniel Jackson. Automating first-order relational logic. In Proc. 8th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), San Diego, CA, November 2000.
10. Daniel Jackson. Micromodels of software: Modelling and analysis with Alloy, 2001. http://sdg.lcs.mit.edu/alloy/book.pdf.
11. Daniel Jackson and Alan Fekete. Lightweight analysis of object interactions. In Proc. Fourth International Symposium on Theoretical Aspects of Computer Software, Sendai, Japan, October 2001.
12. Daniel Jackson, Ian Schechter, and Ilya Shlyakhter. ALCOA: The Alloy constraint analyzer. In Proc. 22nd International Conference on Software Engineering (ICSE), Limerick, Ireland, June 2000.
13. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. European Conference on Artificial Intelligence (ECAI), Vienna, Austria, August 1992.
14. Sarfraz Khurshid and Daniel Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In Proc. 15th IEEE International Conference on Automated Software Engineering (ASE), Grenoble, France, Sep 2000.
15. Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, and Daniel Jackson. A case for efficient solution enumeration. In Proc. Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Santa Margherita Ligure, Italy, May 2003.
16. Ines Lynce and Joao P. Marques-Silva. Probing-based preprocessing techniques for prepositional satisfiability. In Proc. the IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), November 2003.
17. Joao P. Marques-Silva and T. Glass. Combinational equivalence checking using satisfiability and recursive learning. In Proc. the IEEE/ACM Design, Automation and Testing in Europe (DATE), pages 145-149, March 2003.
18. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference (DAC), June 2001.
19. Sanjai Narain. Network configuration management via model finding. Internal report, Telcordia Research, Piscataway, NJ, Sep 2004.
20. Sanjit A. Seshia, Shuvendu K. Lahiri, and Randal E. Bryant. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions". In Proc. 40thConference on Design Automation (DAC), pages 425-430, June 2003.
21. Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search problems. In Proc. Workshop on Theory and Applications of Satisfiability Testing, June 2001.
22. Ilya Shlyakhter, Manu Sridharan, Robert Seater, and Daniel Jackson. Exploiting subformula sharing in automatic analysis of quantified formulas. In Proc. 6th International Conference on Theory and Applications of Satisfiability Testing (SAT), May 2003.
23. Sathiamoorthy Subbarayan and Dhiraj K Pradhan. NiVER: Non increasing variable elimination resolution for preprocessing SAT instances. In Proc. 7th International Conference on Theory and Applications of Satisfiability Testing (SAT), May 2004.
24. Mandana Vaziri. Finding Bugs Using a Constraint Solver. PhD thesis, Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 2003.
25. M. N. Velev. Efficient translation of boolean formulas to CNF in formal verification of microprocessors. In Asia and South Pacific Design Automation Conference (ASP-DAC), pages 310-315, January 2004.
26. M. N. Velev. Encoding global unobservability for efficient translation to SAT. In Proc. 7th International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 197-204, May 2004.
27. Lintao Zhang and Sharad Malik. The quest for efficient boolean satisfiability solvers. In Proc. 8thConference on Automated Deduction (CADE), July 2002.