Pos(T ): Analyzing dependencies in typed logic programs

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

Volumn 2244 LNCS, Issue , 2001, Pages 406-420

  Bruynooghe, Maurice ^a   Vanhoof, Wim ^a   Codish, Michael ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; INFORMATION SCIENCE;

GROUNDNESS; LOGIC PROGRAMS; PATTERN INFORMATION; POSITIVE BOOLEAN FUNCTION; PROGRAM PROPERTIES; SIMPLE ANALYSIS; TYPE INFORMATION;

APPLICATION PROGRAMS;

EID: 84871293738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45575-2_40     Document Type: Conference Paper

References (30)

1. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, V olume B, Formal Models and Semantics, pages 493-574. Elsevier Science Publishers B.V., 1990.
2. R. Bagnara, P. M. Hill, and E. Zaffanella. Efficient structural information analysis for real CLP languages. In Proc. LPAR2000, volume 1955 of LNCS. Springer, 2000.
3. M. Bruynooghe, M. Leuschel, and K. Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In Proc. ESOP'98, volume 1381 of LNCS, pages 27- 41. Springer, 1998.
4. F. Bueno, M. de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. A model for inter-module analysis and optimizing compilation. In Preproceedings LOPSTR2000, 2000.
5. M. Codish. Efficient goal directed bottom-up evaluation of logic programs. J. Logic Programming, 38(3):354-370, 1999.
6. M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop. In Proc. SAS'94, volume 864 of LNCS, pages 281-296. Springer, 1994.
7. M. Codish and B. Demoen. Analyzing logic programs using "PROP"-ositional logic programs and a magic wand. J. Logic Programming, 25(3):249-274, 1995.
8. M. Codish, K .Marriott, and C. Taboch. Improving program analyses by structure untupling, . Journal Logic Programming, 43(3), June 2000.
9. A. Cortesi, G. Filé, and W. Winsborough. Prop revisited: propositional formula as abstract domain for groundness analysis. In Proc. LICS'91, pages 322-327. IEEE Press, 1991.
10. A. Cortesi, G. Filé, and W. H. Winsborough. Optimal groundness analysis using propositional logic. J. Logic Programming, 27(2):137-167, 1996.
11. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming: open product and generic pattern construction. Science of Computer Programming, 38(1-3):27-71, 2000.
12. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. POPL'97, pages 238-252, 1977.
13. B. Demoen, M. García de la Banda, W. Harvey, K. Mariott, and P. Stuckey. An overview of HAL. In Proc. CP'99, volume 1713 of LNCS, pages 174-188. Springer, 1999.
14. J. Gallagher, D. Boulanger, and H. Saglam. Practical model-based static analysis for definite logic programs. In Proc. ILPS'95, pages 351-365. MIT Press, 1995.
15. J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In Proc. ICLP'94, pages 599-613. MIT Press, 1994.
16. M. Hermenegildo, F. Bueno, G. Puebla, and P. López. Debugging, and optimization using the Ciao system preprocessor. In Proc. ICLP'99, pages 52-66, 1999.
17. P. Hill and J. Lloyd. The Gödel Language. MIT Press, 1994.
18. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic programming, 13(2&3):205-258, 1992.
19. V. Lagoon and P. J. Stuckey. A framework for analysis of typed logic programs. In Proc. FLOPS 2001, volume 2024 of LNCS, pages 296-310. Springer, 2001.
20. B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM TOPLAS, 16(1):35-101, 1994.
21. G. Levi and F. Spoto. An experiment in domain refinement: Type domains and type representations for logic programs. In Proc. PLILP/ALP'98, volume 1490 of LNCS, pages 152-169. Springer, 1998.
22. J.W. Lloyd. Foundation of Logic Programming. Springer, second edition, 1987.
23. K. Marriott and H. Sondergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1-4):181-196, 1993.
24. A. Mulkers, W. Simoens, G. Janssens, and M. Bruynooghe. On the practicality of abstract equation systems. In Proc. ICLP'95, pages 781-795. MIT Press, 1995.
25. G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. In Proc. ICLP Workshop on Optimization and Implementation of Declarative Languages, 1999.
26. O. Ridoux, P. Boizumault, and F. Malésieux. Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog. In Proc. FLOPS'99, volume 1722 of LNCS, pages 267-283. Springer, 1999.
27. J.G. Smaus, P. M. Hill, and A. King. Mode analysis domains for typed logic programs. In Proc. LOPSTR'99, volume 1817 of LNCS, pages 82-101. Springer, 2000.
28. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Logic Programming, 29(1-3):17-64, October-November 1996.
29. W. Vanhoof. Binding-time analysis by constraint solving: A modular and higherorder approach for Mercury. In Proc. LPAR2000, volume 1955 of LNCS, pages 399 - 416, Springer, 2000.
30. W. Vanhoof and M. Bruynooghe. Binding-time analysis for Mercury. In Proc. ICLP'99, pages 500 - 514. MIT Press, 1999.