Exploiting goal independence in the analysis of logic programs

Journal of Logic Programming

Volumn 32, Issue 3, 1997, Pages 247-261

  Codish, Michael ^a   Bruynooghe, Maurice ^a   García De La Banda, Maria ^a   Hermenegildo, Manuel ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE;

GENERIC TOP DOWN ANALYZER; GOAL INDEPENDENCE; GOAL INDEPENDENT ANALYSIS; MAGIC SET TRANSFORMATION;

LOGIC PROGRAMMING;

EID: 0031232638     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0743-1066(96)00143-4     Document Type: Article

References (24)

1. Barbuti, R., Giacobazzi, R., and Levi, G., A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs, ACM Transactions on Programming Languages and Systems 15(1):133-181 (1993).
2. Bruynooghe, M., A Practical Framework for the Abstract Interpretation of Logic Programs, Journal of Logic Programming 10(2):91-124 (1991).
3. Bruynooghe, M., Janssens, G., and Kagedal, A., Live-Structure Analysis for Logic Programming Languages with Declarations, CW Report No. 231, Department of Computer Science, K. U. Leuven, 1996.
4. Codish, M., Dams, D., and Yardeni, E., Bottom-Up Abstract Interpretation of Logic Programs, Journal of Theoretical Computer Science 124:93-125 (1994).
5. Codish, M., García de la Banda, M., Bruynooghe, M., and Hermenegildo, M., Goal Dependent vs Goal Independent Analysis of Logic Programs, in: Proceedings of the Fifth International Conference on Logic Programming and Automated Reasoning, LNAI 822, 305-320 (1994).
6. Codish, M. and Demoen, B., Analysing Logic Programs Using "Prop"-ositional Logic Programs and a Magic Wand, Journal of Logic Programming 25(3):249-274 (1995).
7. Codish, M., Mulkers, A., Bruynooghe, M., García de la Banda, M., and Hermenegildo, M., Improving Abstract Interpretations by Combining Domains, ACM Transactions on Programming Languages and Systems 17(1):28-44 (1995).
8. Corsini, M., Musumbu, K., Rauzy, A., and Le Charlier, B., Efficient Bottom-Up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains, in: Proceedings of the Fifth International Symposium on Programming Language Implementation and Logic Programming, LNCS, Talin, Aug. 1993, Springer-Verlag.
9. Cortesi, A., Filé, G., and Winsborough, W., Prop Revisited: Prepositional Formula as Abstract Domain for Groundness Analysis, Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, IEEE Press, 1991, 322-327.
10. Cortesi, A., Filè, G., and Winsborough, W., Comparison of Abstract Interpretations, in: M. Kuich (ed.), Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92) LNCS 623, Wien, Austria, 1992, pp. 521-532.
11. Cortesi, A., Filé, G., and Winsborough, W., Optimal Groundness Analysis Using Propositional Logic. Journal of Logic Programming 27(2):137-167 (1996).
12. Cousot, P. and Cousot, R., Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, 1977, pp. 238-252.
13. Cousot, P. and Cousot, R., Abstract Interpretation and Application to Logic Programs, Journal of Logic Programming 13(2/3):103-179 (1992).
14. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Computer Science 69(3):289-318 (1989).
15. Gallagher, J., Codish, M., and Shapiro, E., Specialisation of Prolog and FCP Programs Using Abstract Interpretation, New Generation Computing 6:159-186 (1988).
16. Jacobs, D. and Langen, A., Static Analysis of Logic Programs for Independent and Parallelism, Journal of Logic Programming 13(2/3):291-314 (1992).
17. Janssens, G., Bruynooghe, M., and Dumortier, V., A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs, in: Proceedings of the 1995 International Symposium on Logic Programming, MIT Press, 1995, pp. 336-350.
18. Le Charlier, B. and Van Hentenryck, P., Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop, Journal of Logic Programming 23(3):237-278 (1995).
19. Le Charlier, B. and Van Hentenryck, P., Experimental Evaluation of a Generic Abstraction Interpretation Algorithm for Prolog, ACM Transactions on Programming Languages and Systems 16(1):35-101 (1994).
20. Marriott, K. and Søndergaard, H., Bottom-Up Abstract Interpretation of Logic Programs, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle WA, Aug. 1988.
21. Marriott, K. and Søndergaard, H., Precise and Efficient Groundness Analysis for Logic Programs, ACM Letters on Programming Languages and Systems, 2(1-4):181-196 (1993).
22. Mulkers, A., Winsborough, W., and Bruynooghe, M., Live-Structure Data-Flow Analysis for Prolog, ACM Transactions on Programming Languages and Systems 16(2):205-258 (1994).
23. Muthukumar, K. and Hermenegildo, M., Compile-Time Derivation of Variable Dependency Using Abstract Interpretation, Journal of Logic Programming 13(2/3):315-347 (1992).
24. Søndergaard, H., An Application of Abstract Interpretation of Logic Programs: Occur-Check Reduction, Proceedings of ESOP 86, LNCS 213, Springer-Verlag, 1986, pp. 327-338.