Schema-guided synthesis of constraint logic programs

Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998

Volumn 1998-October, Issue , 1998, Pages 168-176

  Flener, Pierre ^a   Zidoum, Hamza ^b   Hnich, Brahim ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNITED ARAB EMIRATES UNIVERSITY   (United Arab Emirates)

^c TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; LOGIC PROGRAMMING; SOFTWARE ENGINEERING;

CONSTRAINT LOGIC PROGRAMS; CONSTRAINT PROGRAMS; CONSTRAINT PROPAGATION; FULLY AUTOMATED; IMPLICIT CONSTRAINTS; INNOVATIVE IDEAS; PERMUTATION PROBLEMS; SCHEMA-GUIDED SYNTHESIS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 0346789384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.1998.732620     Document Type: Conference Paper

References (14)

1. F. Ambert, B. Legeard, et E. Legros. Programmation en logique avec contraintes sur ensembles et multiensembles héréditairement finis. Techniques et Sciences Informatiques 15(3):297-328, 1996.
2. D. Diaz and Ph. Codognet. A minimal extension of the WAM for clp(FD). In D.S. Warren (ed), Proc. of ICLP'93, pp. 774-790. The MIT Press, 1993.
3. Y. Deville and P. Van Hentenryck. Construction of CLP programs. In D.R. Brough (ed), Logic Programming: New Frontiers, pp. 112-135, Kluwer Academic Publishers, 1992.
4. P. Flener, K.-K. Lau, andM.Ornaghi.Correct-schemaguided synthesis of steadfast programs. In M. Lowry and Y. Ledru (eds), Proc. of ASE'97, pp. 153-160. IEEE Computer Society, 1997.
5. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1994.
6. C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3):191-244, 1997.
7. I. Kraan, D. Basin, and A. Bundy. Middle-out reasoning for logic program synthesis. D.S. Warren (ed), Proc. of ICLP'93, pp. 441-455. The MIT Press, 1993.
8. J. Jaffar and M.J. Maher. Constraint logic programming: A survey. J. of Logic Programming 19-20:503-582, 1994.
9. K.-K. Lau and M. Ornaghi. A formal approach to deductive synthesis of constraint logic programs. In J.W. Lloyd (ed), Proc. of ILPS'95, pp. 543-557. The MIT Press, 1995.
10. B. Le Charlier and P. Flener. Specifications are necessarily informal, or: Some more myths of formal methods. J. of Systems and Software 40(3):275-296, 1998.
11. D.R. Smith. Top-down synthesis of divide-andconquer algorithms. Artificial Intelligence 27(1):43-96, 1985.
12. D.R. Smith. The structure and design of global search algorithms. TR KES.U.87.12, Kestrel Institute, 1988.
13. D.R. Smith. KIDS: A semiautomatic program development system. IEEE Trans. Software Engineering 16(9):1024-1043, 1990.
14. D.R. Smith. Towards the synthesis of constraint propagation algorithms. In Y. Deville (ed), Proc. of LOPSTR' 93, pp. 1-9, Springer-Verlag, 1994.