Optimal groundness analysis using propositional logic

Journal of Logic Programming

Volumn 27, Issue 2, 1996, Pages 137-167

  Cortesi, Agostino ^b   File', Gilberto ^b   Winsborough, William ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; OPTIMIZATION; PROGRAMMING THEORY;

ABSTRACT INTERPRETATION; ABSTRACT PROJECTION; ABSTRACT UNIFICATION; DATA FLOW ANALYSES; GROUNDNESS ANALYSIS; LEAST UPPER BOUND;

LOGIC PROGRAMMING;

EID: 0030151621     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00123-9     Document Type: Article

References (34)

1. Amstrong, T., Marriott, K., Schachte, P., and Søndergaard, H., Dependency analysis for logic programs, in B. Le Charlier (ed.), Proc. 1st Static Analysis Symposium, Lecture Notes in Computer Science, Elsevier, New York/Amsterdam, vol. 864, 1994, pp. 266-280.
2. Bell, J. L. and Machover, M., A Course in Mathematical Logic, North Holland, Amsterdam, 1977.
3. Bruynooghe, M., A practical framework for the abstract interpretation of logic programs, J. Logic Programming 10(2):91-124 (1991).
4. Cousot, P. and Cousot, R., Abstract interpretation: A unified framework for static analysis of programs by construction or approximation of fixpoints, in Proc. Fourth ACM Symposium on Principles of Programming Languages, 1977.
5. Cousot, P. and Cousot, R., Abstract interpretation and application to logic programs, J. Logic Programming 13(2 and 3):103-179 (1992).
6. Codish, M. and Demoen, B., Analyzing logic programs using "Prop"-ositional logic programs and a magic wand, in D. Miller (ed.), Logic Programming - Proc. 1993 International Symposium, MIT Press, Cambridge, MA, 1993, pp. 114-129.
7. Codish, M. and Demoen, B., Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop, in Proc. First Static Analysis Symposium, Lecture Notes in Computer Science, Elsevier, New York/Amsterdam, vol. 864, 1994, pp. 281-296.
8. Codish, M., Falaschi, M., and Marriott, K., Suspension analyses for concurrent logic programs, ACM TOPLAS, vol. 16, 1994, pp. 649-686.
9. Codognet, P. and Filé, G., Computations, abstractions and constraints, in Proc. Int. Conf. on Computer Languages, San Francisco, 1992.
10. Cortesi, A. and Filé, G., Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, in P. Hudak and N. Jones (eds.), Proc. ACM Symposium on Partial Evaluation and Semantics Based Program Manipulation, SIGPLAN NOTICES, vol. 26, no. 11, 1991.
11. Cortesi, A., Filé, G., and Winsborough, W., Prop revisited: Propositional formula as abstract domain for groundness analysis, in G. Kahn (ed.), Proc. Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, 1991, pp. 322-327.
12. Cortesi, A., Filé, G., and Winsborough, W., Comparison of abstract interpretations, in Proc. 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Elsevier, New York/Amsterdam, vol. 623, 1992, pp. 521-532.
13. Cortesi, A., Filé, G., and Winsborough, W., Optimal groundness analysis using prepositional formulas, Technical Report 94/11, Department of Mathematics, University of Padova, 1994.
14. Cortesi, A., Van Hentenryck, P., and Le Charlier, B., Combinations of abstract domains for logic programming, in Proc. 21th ACM Symposium on Principles of Programming Languages, Portland, 1994.
15. Dart, P., Dependency analysis and query interfaces for deductive databases, Ph.D. dissertation, Technical Report 88/35, Department of Computer Science, The University of Melbourne, Australia, 1988.
16. Dart, P. W., On derived dependencies and connected databases, J. Logic Programming 11:163-188 (1991).
17. Dart, P. W. and Zobel, J., Efficient run-time checking of typed logic programs, J. Logic Programming 14:31-69 (1992).
18. Debray, S. K., Static inference of modes and data dependencies in logic programs, ACM TOPLAS 11:418-450 (1989).
19. Filé, G. and Ranzato, F., Improving abstract interpretations by systematic lifting to the powerset, in Proc. International Logic Programming Symposium, Ithaca, 1994.
20. Hanus, M., Analysis of nonlinear constraints in CLP(R), in Proc. International Conference on Logic Programming, Budapest, 1993, pp. 83-99.
21. Jacobs, D. and Langen, A., Accurate and efficient approximation of variable aliasing in logic programs, J. Logic Programming 13:291-314 (1992).
22. Jones, N. and Søndergaard, H., A semantics based framework for the abstract interpretation of Prolog, in S. Abramsky and C. Hankin (eds.), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.
23. Lassez, J. L., Maher, M. J., and Marriott, K. G., Unification revisited, in J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, M. Kaufmann Publishers, Los Altos, 1987.
24. Lavrov, I. A. and Maksimova, L. L., Problems in Set Theory, Mathematical Logics and Algorithm Theory, 2nd ed. Nauka, Moscow 1984 (in Russian).
25. Le Charlier, B. and Van Hentenryck, P., Groundness analysis for Prolog: Implementation and evaluation of the domain Prop, in Proc. of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, June 1993.
26. Marriott, K. and Søndergaard, H., Notes for a tutorial on abstract interpretation of logic programs, in North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989.
27. Marriott, K. and Søndergaard, H., Abstract interpretation of logic programs: The denotational approach, in A. Bossi (ed.), Proc. GULP'90, Padova, 1990.
28. Marriott, K. and Søndergaard, H., Precise and efficient groundness analysis for logic programs, ACM LOPLAS 2:81-196(1993).
29. Marriott, K., Søndergaard, H., and Jones, N., Denotational abstract interpretation of logic programs, ACM TOPLAS 16:607-648 (1994).
30. Mellish, C. S., The automatic generation of mode declarations for Prolog programs, in Proc. Workshop on Logic Programming for Intelligent Systems, Los Angeles, 1981.
31. Post, E. L., The two valued iterative systems of mathematical logic, Annals of Math. Studies, vol. 5, 1941.
32. Thatcher, J. W., Wagner, E. G., and Wright, J. B., More on advice on structuring compiler and proving them correct, Theoret. Comput. Sci. 15:223-249 (1981).
33. Van Hentenryck, P., Cortesi, A., and Le Charlier, B., Type analysis of Prolog using type graphs, J. Logic Programming 22(3):179-208 (1995).
34. Van Hentenryck, P., Cortesi, A., and Le Charlier, B., Evaluation of the domain Prop, J. Logic Programming 23(3):237-278 (1995).