A backward analysis for constraint logic programs

Theory and Practice of Logic Programming

Volumn 2, Issue 4-5, 2002, Pages 517-547

  King, Andy ^a   Lu, Lunjin ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b OAKLAND UNIVERSITY   (United States)

Author keywords

Abstract interpretation; Backward analysis; Condensing; Constraint Logic Programs; Groundness analysis

Indexed keywords

EID: 0242480018     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001436     Document Type: Article

References (38)

1. Armstrong, T., Marriott, K., Schachte, P. and Søndergaard, H. (1998) Two classes of Boolean functions for dependency analysis. Sci. Comput. Program. 31(1), 3-45.
2. Bagnara, R. and Schachte, P. (1999) Factorizing equivalent variable pairs in ROBDD-based implementations of Pos. International Conference on Algebraic Methodology and Software Technology: Lecture Notes in Computer Science 1548, pp, 471-485. Springer-Verlag.
3. Bagnara, R., Zaffanella, E., Gori, R. and Hill, P. M. (2000) Boolean functions for finite-tree dependencies. International Conference on Logic for Programming, Artificial Intelligence and Reasoning: Lecture Notes in Artificial Intelligence 2250, pp. 575-589. Springer-Verlag.
4. Birkhoff, G. (1967) Lattice Theory. AMS Press.
5. Bossi, A., Gabbrielli, M., Levi, G. and Martelli, M. (1994) The s-semantics approach: theory and applications. J. Logic Program. 19/20, 149-197.
6. Boye, J., Drabent, W. and Małuszyński, J. (1997) Declarative diagnosis of constraint programs: an assertion-based approach. Proceedings of the Third International Workshop on Automated Debugging, pp. 123-141. University of Linköping Press.
7. Codish, M. and Lagoon, V. (2000) Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238, 131-159.
8. Codish, M. and Taboch, C. (1999) A semantic basis for the termination analysis of logic programs. J. Logic Program. 41(1), 103-123.
9. Cousot, P. and Cousot, R. (1982) Inductive principles for proving invariance properties of programs. Tools and Notions for Program Construction, pp. 75-119. Cambridge University Press.
10. Cousot, P. and Cousot, R. (1992) Abstract interpretation and application to logic programs. J. Logic Program. 13(2-3), 103-179.
11. Debray, S. (1993) QD-Janus: a sequential implementation of Janus in Prolog. Software-Practice & Exper. 23(12), 1337-1360.
12. Debray, S., Gudeman, D. and Bigot, P. (1992) Detection and optimization of suspension-free logic programs. J. Logic Program. 29(1-3), 171-194.
13. Drabent, W. and Małuszyński, J. (1988) Inductive assert on method for logic programs. Theor. Comput. Sci. 59(1), 133-155.
14. Dyber, P. (1991) Inverse image analysis generalises strictness analysis. Infor. & Computation, 90(2), 194-216.
15. Falaschi, M., Hicks, P. and Winsborough, W. (2000) Demand transformation analysis for concurrent constraint programs. J. Logic Program. 41(3), 185-215.
16. Filé, G. and Ranzato, F. (1994) Improving abstract interpretations by systematic lifting to the powerset. International Logic Programming Symposium, pp. 655-669. MIT Press.
17. Genaim, S. and Codish, M. (2001) Inferring termination conditions for logic programs using backwards analysis. International Conference on Logic for Programming, Artificial Intelligence and Reasoning: Lecture Notes in Artificial Intelligence 2250, pp. 681-690. Springer-Verlag.
18. Giacobazzi, R. (1998) Abductive analysis of modular logic programs. J. Logic & Computation, 8(4), 457-484.
19. Giacobazzi, R. and Scozzari, F. (1998) A logical model for relational abstract domains. ACM Trans. Programming Lang. Syst. 20(5), 1067-1109.
20. Giacobazzi, R., Debray, S. and Levi, G. (1995) Generalized semantics and abstract interpretation for constraint logic programs. J. Logic Program. 25(3), 191-248.
21. Giacobazzi, R., Ranzato, F. and Scozzari, F. (1998) Building complete abstract interpretations in a linear logic-based setting. Static Analysis Symposium: Lecture Notes in Computer Science 1503, pp. 215-229. Springer-Verlag.
22. Hall, C. and Wise, D. (1989) Generating function versions with rational strictness patterns. Sci. Comput. Program. 12, 39-74.
23. Heaton, A., Abo-Zaed, M., Codish, M. and King, A. (2000) A simple polynomial groundness analysis for logic programs. J. Logic Program. 45(1-3), 143-156.
24. Hughes, R. J. M. and Launchbury, J. (1994) Reversing abstract interpretations. Sci. Comput. Program. 22, 307-326.
25. Jaffar, J. and Maher, M. J. (1994) Constraint logic programming: a survey. J. Logic Program. 19/20, 503-581.
26. Langen, A. (1991) Advanced Techniques for Approximating Variable Aliasing in Logic Programs. PhD thesis, Computer Science Department, Los Angeles.
27. Marriott, K. and Sondergaard, H. (1993) Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst. 2(4), 181-196.
28. Mazur, N., Janssens, G. and Bruynooghe, M. (2000) A module based analysis for memory reuse in Mercury. Computational Logic: Lecture Notes in Artificial Intelligence 1861, pp. 1255-1269.
29. Mesnard, F. (1996) Inferring left-terminating classes of queries for constraint logic programs. Joint International Conference and Symposium on Logic Programming, pp. 7-21. MIT Press.
30. Mesnard, F. and Neumerkel, U. (2001) Applying static analysis techniques for inferring termination conditions of logic programs. Static Analysis Symposium: Lecture Notes in Computer Science 2126, pp. 93-110. Springer-Verlag.
31. Mycroft, A. (1981) Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh.
32. Puebla, G., Bueno, F. and Hermenegildo, M. (2000a) An assertion language for constraint logic programs. Analysis and Visualization Tools for Constraint Programming: Lecture Notes in Computer Science 1870, pp. 23-61. Springer-Verlag.
33. Puebla, G., Bueno, F. and Hermenegildo, M. (2000b) A generic preprocessor for program validation and debugging. Analysis and Visualization Tools for Constraint Programming: Lecture Notes in Computer Science 1870, pp. 63-107. Springer-Verlag.
34. Saraswat, V., Kahn, K. and Levy, J. (1990) Janus: a step towards distributed constraint programming. North American Conference on Logic Programming, pp. 431-446. MIT Press.
35. Scozzari, F. (to appear 2002) Logical optimality of groundness analysis. Theor. Comput. Sci. 277, (112), 149-184.
36. 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), 17-64.
37. van Dalen, D. (1997) Logic and Structure. Springer-Verlag.
38. Wadler, P. and Hughes, R. J. M. (1987) Projections for strictness analysis. Functional Programming and Computer Architecture: Lecture Notes in Computer Science 274, pp. 385-407. Springer-Verlag.