Algebraic approach to sharing analysis of logic programs

Journal of Logic Programming

Volumn 42, Issue 2, 2000, Pages 111-149

  Codish, Michael ^a   Lagoon, Vitaly ^a   Bueno, Francisco ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; PROGRAM DEBUGGING;

SET LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0034135741     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00007-2     Document Type: Article

References (36)

1. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Model and Semantics, Elsevier, Amsterdam, MIT Press, Cambridge, MA, 1990, pp. 495-574.
2. F. Baader, J. Siekmann, Unification theory, in: C. Hogger, D. Gabbay, J. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, Oxford Science Publications, 1994, pp. 41-126.
3. R. Bagnara, P. Hill, E. Zaffanella, Set-sharing is redundant for pair-sharing, in: P. Van Hentenryck (Ed.), Proceedings of the Fourth International Static Analysis Symposium, vol. 1302, LNCS, Springer, Berlin, September, 1997, pp. 53-67.
4. A. Bossi, M. Gabbrielli, G. Levi, M. Martelli, The s-semantics approach: Theory and applications, Journal of Logic Programming 19/20 (1994) 149-198.
5. M. Bruynooghe, M. Codish, Freeness, sharing, linearity and correctness - all at once, in: P. Cousot, M. Falaschi, G. Filè, A. Rauzy (Eds.), Third International Workshop on Static Analysis WSA'93, vol. 724, LNCS, Springer, Berlin, September, 1993, pp. 153-164.
6. M. Codish, D. Dams, G. Filè, M. Bruynooghe, Freeness analysis for logic programs - and correctness, in: David S. Warren, (Ed.), Proceedings of the Tenth International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1993, pp. 116-131.
7. M. Codish, D. Dams, G. Filé, M. Bruynooghe, On the design of a correct freeness analysis for logic programs, Journal of Logic Programming 28 (3) (1996) 181-206.
8. M. Codish, D. Dams, E. Yardeni, Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis, in: Koichi Furukawa (Ed.), Proceedings of the Eighth International Conference on Logic Programming, The MIT Press, Cambridge, MA, 1991, pp. 79-93.
9. M. Codish, B. Demoen, Analyzing logic programs using "PROP"-ositional logic programs and a magic wand, Journal of Logic Programming 25 (3) (1995) 249-274.
10. M. Codish, B. Demoen, K. Sagonas, General purpose semantic based analysis using XSB. Technical report, Ben-Gurion University of the Negev, January 1997, ftp://ftp.cs.bgu.ac.il/pub/people/codish/ absxsb.ps.
11. M. Codish, V. Lagoon, Type dependencies for logic programs using ACI-unification, Journal of Theoretical Computer Science (to appear).
12. M. Codish, V. Lagoon, F. Bueno, An algebraic approach to sharing analysis of logic programs, in: P. Van Hentenryck (Ed.), Proceedings of the Fourth International Static Analysis Symposium, vol. 1302, LNCS, Springer, Berlin, September, 1997, pp. 68-82.
13. M. Codish, A. Mulkers, M. Bruynooghe, M. Garcá de la Banda, M. Hermenegildo, Improving abstract interpretations by combining domains, ACM Transactions on Programming Languages and Systems 17 (1) (1995) 28-44.
14. P. Codognet, G. Filé, Computations, abstractions and constraints, in: Proceedings of the Fourth IEEE International Conference on Computer Languages, IEEE Press, New York, 1992.
15. A. Cortesi, G. Filé, Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, in: P. Hudak, N.D. Jones (Eds.), Proceedings of the ACM SIGPLAN Symposium on partial evaluation and semantics based program manipulation, PEPM's 91, number 26 in Sigplan notices, ACM, 1991, pp. 52-61.
16. P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, ACM Press, New York, January, 1977, pp. 238-252.
17. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of the Sixth ACM Symposium on Principles of Programming Languages, ACM Press, 1979, pp. 269-282.
18. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
19. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, A model-theoretic reconstruction of the operational semantics of logic programs, Information and Computation 102 (1) (1993) 86-113.
20. T. Frühwirth, E. Shapiro, M. Vardi, E. Yardeni, Logic programs as types for logic programs, in: Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, July, 1991, pp. 300-309.
21. J. Gallagher, D.A. de Waal, Fast and precise regular approximation of logic programs, in: Pascal Van Hentenryck (Ed.), Proceedings of the Eleventh International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 599-613.
22. R. Giacobazzi, S. Debray, G. Levi, Generalized semantics and abstract interpretation for constraint logic programs, Journal of Logic Programming 25 (3) (1995) 191-248.
23. M.V. Hermenegildo, R. Warren, S.K. Debray, Global flow analysis as a practical compilation tool, Journal of Logic Programming 13 (4) (1992) 349-366.
24. M.V. Hermenegildo, K.J. Greene, &-Prolog and its performance: Exploiting independent and-parallelism, in: David H.D. Warren, Peter Szeredi (Eds.), Seventh International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1990, pp. 253-268.
25. D. Jacobs, A. Langen, Static analysis of logic programs for independent and- parallelism, Journal of Logic Programming 13 (2/3) (1992) 291-314.
26. D. Kapur, P. Narendran, Complexity of unification problems with associative-commutative operators, Journal of Automated Reasoning 9 (2) (1992) 261-288.
27. V. Lagoon, Logic program analysis using set logic programs. Master's thesis, Ben-Gurion University of the Negev (Israel), 1998.
28. A. Langen, Static analysis for independent And-Parallelism in logic programs. Ph.D. thesis, University of Southern California, 1990.
29. P. Lincoln, J. Christian, Adventures in associative-commutative unification, Journal of Symbolic Computation 8 (1989) 217-240; in: Claude Kirchner (Ed.), Unification, Academic Press, New York, 1990, pp. 393-416.
30. P. Lincoln, J. Christian, Adventures in associative-commutative unification, Journal of Symbolic Computation 8 (1989) 217-240; in: Claude Kirchner (Ed.), Unification, Academic Press, New York, 1990, pp. 393-416.
31. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
32. K. Muthukumar, M. Hermenegildo, Combined determination of sharing and freeness of program variables through abstract interpretation, in: Koichi Furukawa (Ed.), Proceedings of the Eighth International Conference on Logic Programming, The MIT Press, Cambridge, MA, 1991, pp. 49-63.
33. K. Muthukumar, M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming 13 (2/3) (1992) 315-347.
34. D.A. Plaisted, The occur-check problem in Prolog, in International Symposium on Logic Programming, Atlantic City, IEEE Computer Society, Silver Spring, MD, February, 1984, pp. 272-280.
35. C. Ramakrishnan, I. Ramakrishnan, R. Sekar, A symbolic constraint solving framework for analysis of logic programs, in: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, New York, 1995, pp. 12-23.
36. H. Søndergaard, An application of abstract interpretation of logic programs: Occur check reduction, in: European Symposium on Programming, vol. 213, LNCS, Springer, Berlin, 1986, pp. 327-338.