On the design of a correct freeness analysis for logic programs

Journal of Logic Programming

Volumn 28, Issue 3, 1996, Pages 181-206

  Codish, Michael ^a   Dams, Dennis ^b   Filé, Gilberto ^b   Bruynooghe, Maurice ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FORMAL LOGIC; INFORMATION THEORY; SYSTEMS ANALYSIS;

ABSTRACT EQUATION SYSTEMS; CONCRETE ALGORITHM; FREENESS ANALYSIS;

LOGIC PROGRAMMING;

EID: 0030241548     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00120-4     Document Type: Article

References (21)

1. Bruynooghe, M., A Practical Framework for the Abstract Interpretation of Logic Programs, Journal of Logic Programming 10(2):91-124 (Feb. 1991).
2. Bruynooghe, M., and Codish, M., Freeness, Sharing, Linearity and Correctness -All at Once, in: P. Cousot. M. Falaschi, G. Filé, and A. Rauzy (eds.), Proc. 3rd International Workshop on Static Analysis, no. 724 in Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 153-164.
3. Bruynooghe, M., Codish, M., and Mulkers, A., Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables, Workshop on Verification and Analysis of (Concurrent) Logic Languages, ICLP94, June 1994.
4. Codish, M., Dams, D., and Yardeni, E., Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis, in: Furukawa [11], pp. 79-93.
5. Codish, M., Dams, D., Filé, G., and Bruynooghe, M., Freeness Analysis for Logic Programs - And Correctness?, in: D. S. Warren (ed.), Proc. 10th International Conference on Logic Programming, Budapest, Hungary, MIT Press, 1993, pp. 116-131.
6. Codish, M., Mulkers, A., Bruynooghe, M., García de la Banda, M., and M. Hermenegildo, Improving Abstract Interpretations by Combining Domains, in: Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, 1993, pp. 194-205. To appear in ACM Trans. Prog. Lang. Syst.
7. Cortesi, A., and Filé, G., Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis, in: Proc. ACM Symposium on Partial Evaluation and Semantics-Based Program Transformation, ACM Press, 1991.
8. Colmerauer, A., Prolog and Infinite Trees, in: K. L. Clark and S. A. Tärnlund (eds.), Logic Programming, Academic Press, 1982, pp. 231-251.
9. Cousot, P., and Cousot, R., Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, in: Proc. 4th ACM Symposium on Principles of Programming Languages, Jan. 1977, pp. 238-252.
10. Debray, S. K., Static Inference of Modes and Data Dependencies in Logic Programs, ACM Trans. Prog. Lang. Syst. 11(3):418-450 (July 1989).
11. Furukawa, K. (ed.), Proc. 8th International Conference on Logic Programming, Paris, France, 1991, MIT Press.
12. Bueno, F., García de la Banda, M., and Hermenegildo, M., Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization, in: International Symposium on Logic Programming, MIT Press, Nov. 1994, pp. 320-336.
13. Hermenegildo, M. V., and Greene, K. J., &Prolog and Its Performance: Exploiting Independent And-Parallelism, in: D. H. D. Warren and P. Szeredi (eds.), Proc. 7th International Conference on Logic Programming, Jerusalem, MIT Press, 1990, pp. 253-268.
14. Jacobs, D., and Langen, A., Static Analysis of Logic Programs for Independent and Parallelism, Journal of Logic Programming 13(2, 3):291-314 (1992).
15. Lassez, J.-L., Maher, M. J., and Marriott, K., Unification Revisited, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 587-625.
16. Marriott, K., and Søndergaard, H., Analysis of Constraint Logic Programs, in: S. Debray and M. Hermenegildo (eds.), Proc. 1990 North American Conference on Logic Programming, Austin, TX, ALP, MIT Press, 1990, pp. 531-547.
17. Martelli, A., and Montari, U., An Efficient Unification Algorithm, ACM Trans. Prog. Lang. Syst. 4(2):258-282 (Apr. 1982).
18. Mulkers, A., Simoens, W., Janssens, G., and Bruynooghe, M., On the Practicality of Abstract Equation Systems, in: L. Sterling (ed.), Proc. International Conference on Logic Programming, Kanagawa, Japan, MIT Press, 1995, pp. 781-795.
19. Muthukumar, K., and Hermenegildo, M., Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation, in: Furukawa [11], pp. 49-63.
20. Søndergaard, H., An Application of Abstract Interpretation of Logic Programs: Occur-Check Reduction, in: Proc. European Symposium on Programming '86, no. 213 in Lecture Notes in Computer Science, Springer-Verlag, 1986 (extended abstract), pp. 327-338.
21. Sundararajan, R., and Conery, J., An Abstract Interpretation Scheme for Groundness, Freeness and Sharing Analysis of Logic Programs, in: Conference on Foundations of Software Technology and Theoretical Computer Science, no. 652 in Lecture Notes in Computer Science, New Delhi, Springer-Verlag, Dec. 1992, pp. 203-216.