Widening sharing

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

Volumn 1702, Issue , 1999, Pages 414-431

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

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF PARMA   (Italy)

^c UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Mode analysis; Sharing analysis; Widening

Indexed keywords

ABSTRACTING; WIDENING (TRANSPORTATION ARTERIES);

GROUNDNESS; LOGIC PROGRAMS; MODE ANALYSIS; NON-REDUNDANT; SHARING ANALYSIS; WIDENING TECHNIQUES;

LOGIC PROGRAMMING;

EID: 84979021267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704567_25     Document Type: Conference Paper

References (19)

1. R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Universitá di Pisa, Corso Italia 40, I-56125 Pisa, Italy, March 1997. Printed as Report TD-1/97. 418.
2. R. Bagnara. Widening Pos: Simple, effective, and rarely needed. Unpublished short note, 1998. 419.
3. 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. 414, 416, 417, 417, 421, 421.
4. R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, 1999. To appear. 417.
5. R. Bagnara and P. Schachte. Factorizing equivalent variable pairs in ROBDDbased implementations of Pos. In A. M. Haeberer, editor, Proceedings of the "Sev-enth International Conference on Algebraic Methodology and Software Technology (AMAST'98)", volume 1548 of Lecture Notes in Computer Science, pages 471-485, Amazonia, Brazil, 1999. Springer-Verlag, Berlin. 417, 419.
6. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Communi-cations of the ACM, 16(9): 575-577, 1973. 426.
7. M. Bruynooghe, M. Codish, and A. Mulkers. Abstract unification for a composite domain deriving sharing and freeness properties of program variables. In F. S. de Boer and M. Gabbrielli, editors, Verification and Analysis of Logic Languages, Proceedings of the W2 Post-Conference Workshop, International Conference on Logic Programming, pages 213-230, Santa Margherita Ligure, Italy, 1994. 417.
8. M. Codish, H. Sándergaard, and P. J. Stuckey. Sharing and groundness dependencies in logic programs. Submitted for publication. 417, 419.
9. A. Cortesi and G. Filffe. Comparison and design of abstract domains for sharing analysis. In D. Saccá, editor, Proceedings of the "Eighth Italian Conference on Logic Programming (GULP'93)", pages 251-265, Gizzeria, Italy, 1993. Mediterranean Press. 418.
10. A. Cortesi and G. Filffe. Sharing is optimal. Journal of Logic Programming, 38(3): 371-386, 1999. 420.
11. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of the 4th International Symposium on Program-ming Language Implementation and Logic Programming, volume 631 of Lecture Notes in Computer Science, pages 269-295, Leuven, Belgium, 1992. Springer-Verlag, Berlin. 416, 417.
12. C. Fecht. An efficient and precise sharing domain for logic programs. In H. Kuchen and S. D. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium, volume 1140 of Lecture Notes in Computer Science, pages 469-470, Aachen, Germany, 1996. Springer-Verlag, Berlin. Poster. 414, 416.
13. C. Fecht. Efficient and precise sharing domains for logic programs. Technical Report A/04/96, Universität des Saarlandes, Fachbereich 14 Informatik, Saarbrücken, Germany, 1996. 414, 416.
14. P. M. Hill, R. Bagnara, and E. Zaffanella. The correctness of set-sharing. In G. Levi, editor, Static Analysis: Proceedings of the 5th International Symposium, volume 1503 of Lecture Notes in Computer Science, pages 99-114, Pisa, Italy, 1998. Springer-Verlag, Berlin. 420, 420.
15. D. Jacobs and A. Langen. Static analysis of logic programs for independent AND parallelism. Journal of Logic Programming, 13(2&3): 291-314, 1992. 414, 416, 420.
16. 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. 422.
17. K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming, 13(2&3): 315-347, 1992. 417.
18. H. Sándergaard. An application of abstract interpretation of logic programs: Occur check reduction. In Proceedings of the 1986 European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, pages 327-338. Springer-Verlag, Berlin, 1986. 418.
19. E. Zaffanella, R. Bagnara, and P. M. Hill. Widening Sharing. Submitted for publication. Available at http://www. cs. unipr. it/-bagnara/, 1999. 417, 417, 420, 423, 424, 425, 425, 425.