The correctness of set-sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1503 LNCS, Issue , 1998, Pages 99-114

  Hill, Patricia M ^a   Bagnara, Roberto ^b   Zaffanella, Enea ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF PARMA   (Italy)

^c UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Abstract interpretation; Logic programming; Occur check; Ra tional trees; Set sharing

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; LOGIC PROGRAMMING; MODEL CHECKING; SEMANTICS;

ABSTRACT INTERPRETATIONS; ABSTRACTION FUNCTIONS; GENERIC PROPERTIES; MATHEMATICAL FRAMEWORKS; OCCUR-CHECK; SET-SHARING; SHARING ANALYSIS; THEORETICAL STUDY;

STATIC ANALYSIS;

EID: 84905019988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49727-7_6     Document Type: Conference Paper

References (17)

1. R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In P. Van Hentenryck, editor, Static Analysis: Proceedings of the 4th International Symposium, volume 1302 of Lecture Notes in Computer Science, pages 53-67, Paris, France, 1997. Springer-Verlag, Berlin.
2. M. Bruynooghe and M. Codish. Freeness, sharing, linearity and correctness-All at once. In P. Cousot, M. Falaschi, G. Fiĺe, and A. Rauzy, editors, Static Analysis, Proceedings of the Third International Workshop, volume 724 of Lecture Notes in Computer Science, pages 153-164, Padova, Italy, 1993. Springer-Verlag, Berlin. An extended version is available as Technical Report CW 179, Department of Computer Science, K.U. Leuven, September 1993.
3. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322, Toulouse, France, 1978. Plenum Press.
4. M. Codish, D. Dams, G. Filé, and M. Bruynooghe. Freeness analysis for logic programs-and correctness? In D. S. Warren, editor, Logic Programming: Proceedings of the Tenth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 116-131, Budapest, Hungary, 1993. The MIT Press. An extended version is available as Technical Report CW 161, Department of Computer Science, K.U. Leuven, December 1992.
5. A. Colmerauer. Prolog and Infinite Trees. In K. L. Clark and S. A. Tärnlund, editors, Logic Programming, APIC Studies in Data Processing, volume 16, pages 231-251. Academic Press, New York, 1982.
6. A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'84), pages 85-99, Tokyo, Japan, 1984. ICOT.
7. P. M. Hill, R. Bagnara, and E. Zaffanella. The correctness of set-sharing. Technical Report 98.03, School of Computer Studies, University of Leeds, 1998.
8. D. Jacobs and A. Langen. Accurate and efficient approximation of variable aliasing in logic programs. In E. L. Lusk and R. A. Overbeek, editors, Logic Programming: Proceedings of the North American Conference, MIT Press Series in Logic Programming, pages 154-165, Cleveland, Ohio, USA, 1989. The MIT Press.
9. D. Jacobs and A. Langen. Static analysis of logic programs for independent AND parallelism. Journal of Logic Programming, 13(2&3):291-314, 1992.
10. J. Jaffar, J-L. Lassez, and M. J. Maher. Prolog-II as an instance of the logic programming scheme. In M. Wirsing, editor, Formal Descriptions of Programming Concepts III, pages 275-299. North Holland, 1987.
11. T. Keisu. Tree Constraints. PhD thesis, The Royal Institute of Technology, Stockholm, Sweden, May 1994. Also available in the SICS Dissertation Series: SICS/D-16-SE.
12. A. King. A synergistic analysis for sharing and groundness which traces linearity. In D. Sannella, editor, Proceedings of the Fifth European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 363-378, Edinburgh, UK, 1994. Springer-Verlag, Berlin.
13. A. King and P. Soper. Depth-k sharing and freeness. In P. Van Hentenryck, editor, Logic Programming: Proceedings of the Eleventh International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 553-568, Santa Margherita Ligure, Italy, 1994. The MIT Press.
14. A. Langen. Static Analysis for Independent And-Parallelism in Logic Programs. PhD thesis, Computer Science Department, University of Southern California, 1990. Printed as Report TR 91-05.
15. M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 348-357, Edinburgh, Scotland, 1988. IEEE Computer Society.
16. K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming, 13(2&3):315-347, 1992.
17. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.