Faster constraint solving with subtypes

ISSTA 2004 - Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis

Volumn , Issue , 2004, Pages 232-242

  Edwards, Jonathan ^a   Jackson, Daniel ^a   Torlak, Emina ^a   Yeung, Vincent ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Analysis; Constraints; Relational logic; SAT; Subtypes; Verification

Indexed keywords

BINARY CODES; BOOLEAN ALGEBRA; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; HIERARCHICAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

ALLOY ANALYZERS; CONSTRAINTS; RELATIONAL LOGIC; SAT; SUBTYPES; VERIFICATION;

CONSTRAINT THEORY;

EID: 18144412715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007512.1007544     Document Type: Conference Paper

References (29)

1. T. Andrews, S. Qadeer, S. K. Rajamani, J. Rehof, and Y. Xie. Zing: A Model Checker for Concurrent Software. Microsoft Research Technical Report MSR-TR-2004-10. January, 2004.
2. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic model checking without BDDs. Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems, March, 1999.
3. Avrim Blum. Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90:281-300, 1997.
4. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
5. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new symbolic model checker. International Journal on Software Tools for Technology Transfer, 2000.
6. Jonathan Edwards, Daniel Jackson, and Emina Torlak. A Type System for Object Models. Submitted for publication. http://sdg.lcs.mit.edu/pubs/TR/typesforobjectmodels.pdf
7. Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Soerensen, and Mads Tofte. AnnoDomini: From Type Theory to Year 2000 Conversion Tool. In 26th ACM Symposium on the Principles of Programming Languages, January, 1999.
8. Michael Ernst, Todd Millstein and Daniel Weld. Automatic SAT compilation of planning problems. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1997.
9. E. Goldberg and Y. Novikov. BerkMin: A Fast and Robust SAT Solver. Design Automation and Test in Europe (DATE) 2002.
10. Paul Halmos. Problems for Mathematicians, Young and Old The Mathematical Association of America, 1991.
11. Gerard J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 2004.
12. Daniel Jackson. Automating First-Order Relational Logic. ACM SIGSOFT Conference on Foundations of Software Engineering, San Diego, CA, November, 2000.
13. Daniel Jackson, Somesh Jha and Craig A. Damon. Isomorph-free Model Enumeration: A New Method for Checking Relational Specifications. A CM Transactions on Programming Languages and Systems 20(2):302-343, 1998.
14. Daniel Jackson, Ilya Shlyakhter and Manu Sridharan. A Micromodularity Mechanism ACM SIGSOFT Conference on Foundations of Software Engineering / European Software Engineering Conference, Vienna, Austria, September, 2001.
15. Rajeev Joshi, Greg Nelson, and Keith Randall. Denali: a goal-directed superoptimizer. http://citeseer.nj.nec.com/joshi01denali.html
16. H. Kautz, and B. Selman. Planning as satisfiability. Proc. European Conference on Artificial Intelligence, Vienna, Austria, 1992.
17. Sarfraz Khurshid and Daniel Jackson. Exploring the Design of an Intentional Naming Scheme with an Automatic Constraint Analyzer. Proc. 15th IEEE International Conference on Automated Software Engineering, Grenoble, France, September, 2000.
18. Leslie Lamport. Specifying Systems: The TLA + Language and Tools for Hardware and Software Engineers. Addison-Wesley Professional, 2002.
19. Leslie Lamport and Lawrence C. Paulson. Should your specification language be typed? ACM Transactions on Programming Languages and Systems 21 (3):502-526, 1999.
20. Michael Leuschel and Michael Butler. ProB: A Model Checker for B. Proceedings Formal Methods Europe, 2003.
21. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
22. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to Typed Assembly Language. In 25th ACM Symposium on the Principles of Programming Languages, 1998.
23. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. 39th Design Automation Conference, Las Vegas, June, 2001.
24. Robert O'Callahan and Daniel Jackson. Lackwit: A Program Understanding Tool Based on Type Inference. Proc. International Conference on Software Engineering, Boston, MA, May, 1997, pp. 338-348.
25. Piza, The Prolog Z Animator. http://www.noodles.demon.co.uk/PiZA/PiZAHome.html
26. Ilya Shlyakter. Generating effective symmetry-breaking predicates for search problems. Electronic Notes in Discrete Mathematics, Vol. 9 (2001).
27. Mandana Vaziri and Daniel Jackson. Checking Properties of Heap-Manipulating Procedures using a Constraint Solver. Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Warsaw, Poland, April, 2003.
28. Tim Wahls, Gary T. Leavens, and Albert L. Baker. Executing formal specifications with constraint programming. Technical Report 97-12a, Department of Computer Science, Iowa State University, August, 1998.
29. D. S. Weld. Recent advances in AI planning. AI Magazine, 20(2):93-123, 1999.