Constraints as control

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2012, Pages 151-164

  Köksal, Ali Sinan ^a   Kuncak, Viktor ^a   Suter, Philippe ^a  

^a EPFL   (Switzerland)

Author keywords

Constraint programming; Embedded domain specific languages; Executable specifications; Non determinism; Satisfiability modulo theories; Scala

Indexed keywords

CONSTRAINT PROGRAMMING; DOMAIN SPECIFIC LANGUAGES; EXECUTABLE SPECIFICATIONS; NON-DETERMINISM; SATISFIABILITY MODULO THEORIES; SCALA;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; EMBEDDED SYSTEMS; PROBLEM ORIENTED LANGUAGES; RECURSIVE FUNCTIONS; SEMANTICS; SPECIFICATIONS; TREES (MATHEMATICS);

CONSTRAINT THEORY;

EID: 84857871513     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103656.2103675     Document Type: Conference Paper

References (66)

1. H. Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, 1991.
2. S. Antoy. Definitional trees. In ALP, pages 143-157, 1992.
3. S. Antoy and M. Hanus. Functional logic programming. CACM, 53 (4):74-85, 2010.
4. K. R. Apt and M. Wallace. Constraint logic programming using Eclipse. Cambridge University Press, 2007.
5. K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-O: An imperative language that supports declarative programming. TOPLAS, 20(5):1014-1066, 1998. (Pubitemid 128655760)
6. R.-J. Back and J. von Wright. Refinement Calculus. Springer-Verlag, 1998.
7. T. Ball, D. Hoffman, F. Ruskey, R. Webber, and L. J. White. State generation and automated class testing. Softw. Test., Verif. Reliab., 10 (3), 2000.
8. C. Barrett and C. Tinelli. CVC3. In CAV, volume 4590 of LNCS, 2007.
9. G. M. Bierman, A. D. Gordon, C. Hritcu, and D. E. Langworthy. Semantic subtyping with an SMT solver. In ICFP, pages 105-116, 2010.
10. A. Blass, Y. Gurevich, and D. Kozen. A zero-one law for logic with a fixed-point operator. Inf. Control, 67, October 1986.
11. C. Boyapati, S. Khurshid, and D. Marinov. Korat: Automated testing based on Java predicates. In Proc. International Symposium on Software Testing and Analysis, pages 123-133, July 2002.
12. B. Braßel, M. Hanus, and M. Müller. High-level database programming in Curry. In PADL, pages 316-332, 2008. (Pubitemid 351153194)
13. K. Claessen and J. Hughes. Quickcheck: a lightweight tool for random testing of haskell programs. In ICFP, pages 268-279, 2000. (Pubitemid 32024728)
14. A. Colmerauer, H. Kanoui, and M. V. Caneghem. Last steps towards an ultimate PROLOG. In IJCAI, pages 947-948, 1981. (Pubitemid 14478664)
15. R. DeLine and K. R. M. Leino. BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report MSR-TR-2005-70, Microsoft Research, March 2005.
16. B. Demsky and M. C. Rinard. Automatic detection and repair of errors in data structures. In OOPSLA, pages 78-95, 2003.
17. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005. (Pubitemid 43078377)
18. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM, 18(8):453-457, 1975.
19. B. Dutertre and L. de Moura. The Yices SMT solver, 2006. http://yices.csl.sri.com/tool-paper.pdf.
20. B. Elkarablieh and S. Khurshid. Juzi: a tool for repairing complex data structures. In ICSE, pages 855-858, 2008.
21. S. Fischer, O. Kiselyov, and C. Shan. Purely functional lazy nondeterministic programming. In ICFP, volume 44, pages 11-22, 2009.
22. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV, pages 175-188, 2004.
23. I. P. Gent, C. Jefferson, and I. Miguel. MINION: A fast, scalable, constraint solver. In European Conference on Artificial Intelligence, pages 98-102. IOS Press, 2006.
24. M. Gligoric, T. Gvero, V. Jagannath, S. Khurshid, V. Kuncak, and D. Marinov. Test generation through programming in udita. In ICSE (1), pages 225-234, 2010.
25. M. Grabmüller and P. Hofstedt. Turtle: A constraint imperative programming language. In Innovative Techniques and Applications of Artificial Intelligence, 2003.
26. S. Gulwani, S. Jha, A. Tiwari, and R. Venkatesan. Synthesis of loopfree programs. In PLDI, pages 62-73, 2011.
27. M. Hanus. Type-oriented construction of web user interfaces. In PPDP, pages 27-38, 2006. (Pubitemid 44729606)
28. M. Hanus and C. Kluß. Declarative programming of user interfaces. In PADL, pages 16-30, 2009.
29. D. Jackson. Structuring Z specifications with views. ACM Transactions on Software Engineering and Methodology, 4(4), October 1995.
30. D. Jackson. Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol., 11(2):256-290, 2002. (Pubitemid 44159313)
31. J. Jaffar and J.-L. Lassez. Constraint logic programming. In POPL, 1987.
32. J. C. King. A Program Verifier. PhD thesis, CMU, 1970.
33. A. S. Köksal, V. Kuncak, and P. Suter. Scala to the power of Z3: Integrating SMT and programming (system description). In CADE, pages 400-406, 2011.
34. R. A. Kowalski and D. Kuehner. Linear resolution with selection function. Artif. Intell., 2(3/4):227-260, 1971.
35. V. Kuncak, M. Mayer, R. Piskac, and P. Suter. Complete functional synthesis. In PLDI, pages 316-329, 2010.
36. L. Lamport. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wessley, 2002.
37. G. Lopez, B. Freeman-Benson, and A. Borning. Kaleidoscope: A constraint imperative programming language. In Constraint Programming, pages 313-329. Springer-Verlag, 1994.
38. M. Z. Malik, J. H. Siddiqui, and S. Khurshid. Constraint-based program debugging using data structure repair. In ICST, pages 190-199, 2011.
39. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst., 2(1):90-121, 1980. ISSN 0164-0925. doi:http://doi.acm.org/10.1145/357084.357090.
40. F. Maric and P. Janicic. Urbiva: Uniform reduction to bit-vector arithmetic. In IJCAR, pages 346-352, 2010.
41. E. Michael Hanus. Curry: An integrated functional logic language. http://www.curry-language.org, 2006. vers. 0.8.2.
42. A. Milicevic, D. Rayside, K. Yessenov, and D. Jackson. Unifying execution of imperative and declarative code. In ICSE, pages 511-520, 2011.
43. C. Morgan. Programming from Specifications (2nd ed.). Prentice-Hall, Inc., 1994.
44. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, 2008.
45. G. Nelson. Techniques for program verification. Technical report, XEROX Palo Alto Research Center, 1981.
46. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM (JACM), 27(2):356-364, 1980. ISSN 0004-5411. doi: http://doi.acm.org/10.1145/322186.322198. (Pubitemid 11428851)
47. N. Nethercote, P. Stuckey, R. Becket, S. Brand, G. Duck, and G. Tack. MiniZinc: Towards a standard CP modelling language. Principles and Practice of Constraint Programming, pages 529-543, 2007.
48. R. Nilsson. Scalacheck user guide. http://code.google.com/p/scalacheck/ wiki/UserGuide, 2011.
49. M. Odersky. Contracts in Scala. In International Conference on Runtime Verification. Springer LNCS, 2010.
50. M. Odersky, L. Spoon, and B. Venners. Programming in Scala: a comprehensive step-by-step guide. Artima Press, 2008.
51. D. Overton, Z. Somogyi, and P. J. Stuckey. Constraint-based mode analysis of Mercury. In ACM SIGPLAN Workshop on Principles and practice of declarative programming (PPDI), 2002.
52. L. C. Paulson, T. Nipkow, et al. Isabelle theorem prover - official website. http://www.cl.cam.ac.uk/Research/HVG/Isabelle.
53. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, 1989.
54. A. Riesco and J. Rodríguez-Hortalá. Programming with singular and plural non-deterministic functions. In PEPM, pages 83-92, 2010.
55. H. Samimi, E. D. Aung, and T. D. Millstein. Falling back on executable specifications. In ECOOP, pages 552-576, 2010.
56. T. Schrijvers, P. J. Stuckey, and P. Wadler. Monadic constraint programming. J. Funct. Program., 19(6):663-697, 2009.
57. J. P. M. Silva and K. A. Sakallah. GRASP - a new search algorithm for satisfiability. In ICCAD, pages 220-227, 1996.
58. A. Solar-Lezama, L. Tancau, R. Bodík, S. A. Seshia, and V. A. Saraswat. Combinatorial sketching for finite programs. In ASPLOS, 2006.
59. P. Suter, M. Dotta, and V. Kuncak. Decision procedures for algebraic data types with abstractions. In ACM SIGPLAN POPL, 2010.
60. P. Suter, A. S. Köksal, and V. Kuncak. Satisfiability modulo recursive programs. In Static Analysis Symposium (SAS), 2011.
61. G. Tack. Constraint Propagation - Models, Techniques, Implementation. PhD thesis, Saarland University, 2009.
62. The Coq Development Team; INRIA LogiCal Project. The Coq proof assistant - official website. http://coq.inria.fr.
63. E. Torlak and D. Jackson. Kodkod: A relational model finder. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2007.
64. P. Van Roy. Logic programming in Oz with Mozart. In ICLP, 1999.
65. R. N. Zaeem and S. Khurshid. Contract-based data structure repair using Alloy. In ECOOP, pages 577-598, 2010.
66. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, pages 279-285, 2001. (Pubitemid 33148971)