The def-inite approach to dependency analysis

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

Volumn 2028, Issue , 2001, Pages 417-431

  Genaim, Samir ^a   Codish, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEPENDENCY ANALYSIS; DUAL REPRESENTATION; GROUNDNESS; PROTO TYPE;

BOOLEAN FUNCTIONS;

EID: 84945267421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45309-1_28     Document Type: Conference Paper

References (22)

1. T. Armstrong, K. Marriott, P. Schachte, and H. Sondergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3-45, 1998.
2. F. Baader and J. Siekmann. Unification theory. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 41-126. Oxford Science Publications, 1994.
3. R. Bagnara and P. Schachte. Factorizing equivalent variable pairs in ROBDD- based implementations of Pos. In A. M. Haeberer, editor, AMAST’98, volume 1548 of LNCS, pages 471-485, Amazonia, Brazil, 1999. Springer-Verlag, Berlin.
4. R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
5. M. Codish. Efficient goal directed bottom-up evaluation of logic programs. Journal of Logic Programming, 38(3):354-370, 1999.
6. M. Codish. Worst-case groundness analysis using positive Boolean functions. Jour-nal of Logic Programming, 41(1):125-128, 1999.
7. M. Codish and V. Lagoon. Type dependencies for logic programs using aci- unification. Theoretical Computer Science, 2000.
8. M. Codish, V. Lagoon, and Bueno F. An algebraic approach to sharing analysis of logic programs. Journal of Logic Programming, 41(2):110-149, 2000.
9. M. Codish and H. S0ndergaard. The Boolean logic of set sharing analysis. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Pro-gramming, volume 1490 of LNCS, pages 89-101, Berlin, 1998. Springer.
10. M. Codish, H. Sondergaard, and P. J. Stuckey. Sharing and groundness depen-dencies in logic programs. ACM Transactions on Programming Languages and, Systems, 21(5):948-976, 1999.
11. A. Cortesi, G. File, and W. Winsborough. The quotient of an abstract interpretation. Theoretical Computer Science, 202(1-2):163-192, 1998.
12. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Evaluation of the domain Prop. Journal of Logic Programming, 23(3):237-278, 1995.
13. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, January 1977.
14. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. Number 631 in LNCS, pages 269-295, Leuven, Belgium, 1992. Springer-Verlag, Berlin.
15. P. W. Dart. On derived dependencies and connected databases. The Journal of Logic Programming, 11(1 & 2):163-188, July 1991.
16. S. Genaim and M. Codish. The Def-inite Approach to Dependency Analysis. Tech-nical report, Computer Science, Ben-Gurion University, 2000. http://www.cs.bgu.ac.il/~mcodish/Papers/ppapers.html.
17. S. Genaim, J.M. Howe, and M. Codish. Worst-case groundness analysis using definite boolean functions, September 2000.
18. A. Heaton, M. Abo-Zaed, M. Codish, and A. King. A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45:143-156.
19. J. M. Howe and A. King. Implementing groundness analysis with definite Boolean functions. In G. Smolka, editor, ESOP, volume 1782 of Lecture Notes in Computer Science. Springer-Verlag, March 2000.
20. A. King, J. G. Smaus, and P. Hill. Quotienting share for dependency analysis. In Doaitse Swierstra, editor, ESOP, volume 1576 of LNCS, pages 59-73. Springer-Verlag, April 1999.
21. Taisuke Sato and Hisao Tamaki. Enumeration of success patterns in logic programs. Theoretical Computer Science, 34(1-2):227-240, November 1984.
22. J. Wunderwald. Memoing evaluation by source-to-source transformation. In Maur-izio Proietti, editor, Proceedings of the Fifth International Workshop on Logic Program Synthesis and Transformation, volume 1048 of LNCS, pages 17-32. Springer.