Sharing is optimal

Journal of Logic Programming

Volumn 38, Issue 3, 1999, Pages 371-386

  Cortesi, Agostino ^a   Filé, Gilberto ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Abstract interpretation; Static analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

ABSTRACT INTERPRETATION; STATIC ANALYSIS;

LOGIC PROGRAMMING;

EID: 0033101935     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10026-2     Document Type: Article

References (15)

1. P. Cousot, R. Cousot, Abstract interpretation: A unified framework for static analysis of programs by construction of approximation of fixpoints, Proceedings of the 4th ACM Symposium on Principles of Programming Languages and Systems, ACM, New York, 1977, pp. 238-252.
2. K. Mutukumar, M. Hermenegildo, Combined determination of sharing and freeness of program variables through abstract interpretation, in: Proceedings of 8th International Conference on Logic Programming ICLP91, Paris, MIT Press, Cambridge, MA, 1991, pp. 49-63.
3. M. Codish, D. Dams, G. Filè, M. Bruynhooghe, On the design of a correct freeness analysis for logic programs, The Journal of Logic Programming 28 (3) (1996) 181-206.
4. A. Bossi, N. Cocco, Programs without failures, in: N. Fuchs (Ed.), Proceedings of the 7th Logic Programming Synthesis and Transformation LOPSTR97, Leuven, Belgium, LNCS, Springer, Berlin, to appear.
5. S. Debray, P. Lopez Garcia, M. Hermenegildo, Non-Failure analysis for logic programs, Proceedings of the 14th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1997, pp. 48-62.
6. D. Jacobs, A. Langen, Accurate and efficient approximation of variable aliasing in logic programs, The Journal of Logic Programming 13 (1992) 291-314.
7. A. Cortesi, G. Filè, W. Winsborough, The quotient of an abstract interpretation, Theoretical Computer Science 202 (1-2) (1998) 163-192.
8. A. Cortesi, G. Filè, R. Giacobazzi, C. Palamidessi, F. Ranzato, Complementation in abstract interpretation, ACM Transactions on Programming Languages and Systems 19 (1) (1997) 7-47.
9. R. Bagnara, P. Hill, E. Zaffanella, Set-sharing is redundant for pair-sharing, in: P. Van Hentenryck (Ed.), Static Analysis: Proceedings of the 4th International Symposium, Paris, France, LNCS vol. 1302, Springer, Berlin, 1997, pp. 53-67.
10. M. Codish, V. Lagoon, F. Bueno, An algebraic approach to sharing analysis of logic programs, in: P. Van Hentenryck (Ed.), Static Analysis: Proceedings of the 4th International Symposium, Paris, France, LNCS vol. 1302, Springer, Berlin, 1997, pp. 68-82.
11. A. Mycroft, Completeness and predicate-based abstract interpretation, in: Proceedings of the ACM Symposium on Partial Evaluation and Program Manipulation, PEPM93, ACM, New York, 1993, pp. 179-185.
12. J-L. Lassez, M. Maher, K. Marriott, Unification revisited, in: Jack Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmanm, Los Altos, CA, 1987, pp. 587-625.
13. P. Cousot, R. Cousot, Abstract interpretation and applications to logic programs, The Journal of Logic Programming 13 (1-4) (1992) 103-179.
14. A. Cortesi, G. Filè, W. Winsborough, Optimal groundness analysis using propositional logic, The Journal of Logic Programming 27 (2) (1996) 137-167.
15. G. Filè, F. Ranzato F, Complementation of abstract domains made easy, in: M. Maher (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP96, MIT Press, Cambridge, MA, 1996, pp. 348-362.