Using parametric set constraints for locating errors in CLP programs

Theory and Practice of Logic Programming

Volumn 2, Issue 4-5, 2002, Pages 549-610

  Drabent, Włodzimierz ^a,b   Małuszyński, Jan ^b   Pietrzak, Paweł ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

Constraint logic programming; Debugging; Descriptive types; Parametric types; Program correctness; Set constraints; Term grammars

Indexed keywords

EID: 19044386018     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001473     Document Type: Article

References (54)

1. Aiken, A. and Lakshman, T. K. (1994) Directional type checking of logic programs. In: LeCharlier, B. (ed.), Proc. 1st Int. Symposium on Static Analysis. LNCS 864, pp. 43-60. Springer-Verlag.
2. Apt, K. R. (1993) Declarative programming in Prolog. In: Miller, D. (ed.), Proceedings International Symposium on Logic Programming, pp. 12-35. MIT Press.
3. Apt, K. R. (1997) From Logic Programming to Prolog. Prentice Hall.
4. Bossi, A. and Cocco, N. (1989) Verifying correctness of logic programs. In: Díaz, J. and Orejas, F. (eds.), Proceedings International Joint Conference on Theory and Practice of Software Development TAPSOFT '89. LNCS 352, pp. 96-110. Springer-Verlag.
5. Boye, J. (1996) Directional Types in Logic Programming. Linköping studies in science and technology, Dissertation no. 437, Linköping University.
6. Boye, J. and Małuszyński, J. (1997) Directional types and the annotation method. J. Logic Program. 33(3), 179-220.
7. Bronsard, F., Lakshman, T. K. and Reddy, U. (1992) A framework of directionality for proving termination of logic programs. In: Apt, K. R. (ed.), Proceedings Joint International Symposium and Conference on Logic Programming, pp. 321-335. MIT Press.
8. Bueno, F., Deransart, P., Drabent, W., Ferrand, G., Hermenegildo, M., Małuszyński, J. and Puebla, G. (1997) On the role of semantic approximations in validation and diagnosis of constraint logic programs. In: Kamkar, M. (ed.), Proceedings AADEBUG'97 (3rd International Workshop on Automated Debugging), pp. 155-169. Linköping University.
9. Charatonik, W. (1998) Set constraints in some equational theories. Infor. & Computation, 142(1), 40-75.
10. Charatonik, W. and Podelski, A. (1997) Set constraints with intersection. In: Winskel, G. (ed.), Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 362-372.
11. Charatonik, W. and Podelski, A. (1998) Directional type inference for logic programs. In: Levi, G. (ed.), Proceedings 5th Static Analysis Symposium (SAS'98). LNCS 1503. Springer-Verlag.
12. Comini, M., Drabent, W., Małuszyński, J. and Pietrzak, P. (1998) A type-based diagnoser for CHIP. ESPRIT DiSCiPl deliverable. (Available at URL: http://discipl.inria.fr/deliverables2.html.)
13. Comini, M., Drabent, W. and Pietrzak, P. (1999) Diagnosis of CHIP programs Using type information. In: Meo, M. C. and Vilares Ferro, M. (eds.), APPIA-GULP-PRODE'99, Joint Conference on Declarative Programming, pp. 337-349.
14. Comini, M., Gori, R., Levi, G. and Volpe, P. (2000) Abstract interpretation based verification of logic programs. In: Etalle, S., & Smaus, J.-G. (eds), Proceedings Workshop on Verification of Logic Programs. Electronic Notes in Theoretical Computer Science, vol. 30. Elsevier. (Available at URL: http://www.elsevier.nl/locate/entcs/volume30.html.)
15. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M. (1997) Tree automata techniques and applications. (Available on: http://www.grappa.univ-lille3.fr/tata.)
16. Cosytec (1998) CHIP system documentation.
17. Cousot, P. and Cousot, R. (1992) Abstract interpretation and application to logic programs. J. Logic Program., 13(2-3), 103-179. (For a correct version of this paper, see http://www.di.ens.fr/~cousot.)
18. Dart, P. and Zobel, J. (1992) A regular type language for logic programs. In: Pfenning, F. (ed.), Types in Logic Programming, pp. 157-187. MIT Press.
19. Deransart, P. (1993) Proof methods of declarative properties of definite programs. Theor. Comput. Sci. 118, 99-166.
20. Deransart, P. and Smaus, J.-G. (2001) Well-typed logic programs are not wrong. In: H. Kuchen and K. Ueda (eds.), Functional and logic programming (FLOPS'2001). LNCS 2024, pp. 280-295. Springer-Verlag.
21. Devienne, P., Talbot, J.-M. and Tison, S. (1997a) Set-based analysis for logic programming and tree automata. In: Van Hentenryck, P. (ed.), Proceedings Static Analysis Symposium, SAS'97. LNCS 1302, pp. 127-140. Springer-Verlag.
22. Devienne, P., Talbot, J.-M. and Tison, S. (1997b) Solving classes of set constraints with tree automata. In: Smolka, G. (ed.), Proceedings 3rd International Conference on Principles and Practice of Constraint Programming - CP97. LNCS 1330, pp. 62-76. Springer-Verlag.
23. Drabent, W. and Małuszyński, J. (1988) Inductive assertion method for logic programs. Theor. Comput. Sci. 59(1), 133-155.
24. Drabent, W. and Pietrzak, P. (1998) Inferring call and success types for CLP programs. ESPRIT DiSCiPl deliverable. (Available at URL: http://discipl.inria.fr/deliverables2.html.)
25. Drabent, W. and Pietrzak, P. (1999) Type Analysis for CHIP. In: Haeberer, A. M. (ed.), Proceedings 7th International Conference on Algebraic Methotology and Software Technology (AMAST'98). LNCS 1548, pp. 389-405. Springer-Verlag.
26. Drabent, W., Małuszyński, J. and Pietrzak, P. (2000a) Locating type errors in untyped CLP programs. In: Hermenegildo, M., Deransart, P. and Małuszyński, J. (eds.), Analysis and Visualization Tools for Constraint Programming. LNCS 1870, pp. 121-150. Springer-Verlag.
27. Drabent, W., Małuszyński, J. and Pietrzak, P. (2000b) Type-based Diagnosis of CLP Pro-grams. Electronic Notes in Theoretical Computer Science, vol. 30. (Available at URL: http://www.elsevier.nl/locate/entcs/volume30.html.)
28. Drabent, W., Małuszyński, J. and Pietrzak, P. (2001) Parametric descriptive types for (C)LP. In: Codognet, P. (ed.), Tenth International French Speaking Conference on Logic and Constraint Programming, pp. 239-254. Hermes-Science.
29. Fages, F. and Coquery, E. (2001) Typing constraint logic programs. Theory & Practice of Logic Program. 1(6), 751-777.
30. Frühwirth, T., Shapiro, E., Vardi, M. and Yardeni, E. (1991) Logic programs as types for logic programs. In: Kahn, G. (ed.), Annual IEEE Symposium on Logic in Computer Science, pp. 300-309. (Corrected version available from http://WWW.pst.informatik.uni-muenchen.de/~fruehwir.)
31. Gallagher, J. and de Waal, D. A. (1994) Fast and precise regular approximations of logic programs. In: Van Hentenryck, P. (ed.), Proceedings 11th International Conference on Logic Programming, pp. 599-613. MIT Press.
32. Heintze, N. (1992) Practical aspects of set based analysis. In: Apt, M. (ed.), Proceedings Joint International Conference and Symposium on Logic Programming, pp. 765-779. MIT Press.
33. Heintze, N. and Jaffar, J. (1990a) A decision procedure for a class of set constraints (extended abstract). Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 42-51.
34. Heintze, N. and Jaffar, J. (1990b) A finite presentation theorem for approximating logic programs. Seventeenth Annual ACM Symposium on Principles of Programming Languages, pp. 197-209.
35. Heintze, N. and Jaffar, J. (1991) A Decision Procedure for a Class of Set Constraints. Technical report CMU-CS-91-110, Carnegie Mellon University.
36. Heintze, N. and Jaffar, J. (1994) Set constraints and set-based analysis. Proceedings Workshop on Principles and Practice of Constraint Programming. LNCS 874, pp. 281-298. Springer-Verlag.
37. Hill, P. M. and Lloyd, J.W. (1994) The Gödel Programming Language. MIT Press.
38. Hopcroft, J. E., Motwani, R. and Ullman, J. D. (2001) Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley.
39. Janssens, G. and Bruynooghe, M. (1992) Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Program. 13(2 & 3), 205-258.
40. Lloyd, J. W. (1987) Foundations of Logic Programming. 2nd edn. Springer-Verlag.
41. Mildner, P. (1999) Type domains for abstract interpretation, a critical study. PhD thesis, Uppsala University.
42. Mishra, P. (1984) Towards a theory of types in Prolog. Proceedings IEEE International Symposium on Logic Programming, pp. 289-298.
43. Mycroft, A. and O'Keefe, R. A. (1984) A polymorphic type system for Prolog. Artif. Intell. 23, 295-307.
44. Puebla, G., Bueno, F. and Hermenegildo, M. (2000) A generic preprocessor for program validation and debugging. In: Hermenegildo, M., Deransart, P. and Małuszyński, J. (eds.), Analysis and Visualization Tools for Constraint Programming. LNCS 1870, pp. 63-107. Springer-Verlag.
45. Rychlikowski, P. and Truderung, T. (2000) Polymorphic directional types for logic programming. PhD thesis, Wroclaw University. (http://www.tcs.uni.wroc.pl/~tt/dirtypes/index.html.)
46. Rychlikowski, P. and Truderung, T. (2001) Polymorphic directional types for logic programming. Proceedings 3rd international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 61-72. ACM Press.
47. SICS (1998) SICStus Prolog user's manual. Intelligent Systems Laboratory.
48. Smaus, J.-G., Fages, F. and Deransart, P. (2000) Using modes to ensure subject reduction for typed logic programs with subtyping. In: Kapoor, S. and Prasad, S. (eds.), Foundations of Software Technology and Theoretical Computer Science (FST TCS'2000). LNCS 1974, pp. 214-226. Springer-Verlag.
49. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury: an efficient purely declarative logic programming language. J. Logic Program., 29(1-3), 14-64.
50. Talbot, J.-M., Devienne, P. and Tison, S. (2000) Generalized definite set constraints. Constraints: An Int. J. 5(1-2), 161-202.
51. Van Hentenryck, P. (1989) Constraint Satisfaction in Logic Programming. MIT Press.
52. Van Hentenryck, P., Cortesi, A. and Charlier, B. Le. (1995) Type analysis of Prolog using type graphs. J. Logic Program. 22(3), 179-209.
53. Yardeni, E. and Shapiro, E. Y. (1991) A type system for logic programs. J. Logic Program. 10(2), 125-153.
54. Zobel, J. (1987) Derivation of polymorphic types for Prolog programs. In: Lassez, J.-L. (ed.), Proceedings Fourth International Conference on Logic Programming, pp. 817-838. MIT Press.