A practical framework for theabstract interpretation of logic programs

The Journal of Logic Programming

Volumn 10, Issue 2, 1991, Pages 91-124

  Bruynooghe, Maurice ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002545591     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(91)80001-T     Document Type: Article

References (21)

1. A Framework for the Abstract Interpretation of Logic Programs
2. An Instance of Abstract Interpretation Integrating Type and Mode Inferencing
3. Abstract Interpretation: Towards the Global Optimization of PROLOG Programs
4. Analysis of Shared Data Structures for Compile-Time Garbage Collection in Logic Programs
5. Prolog and Infinite Trees
6. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints
7. Automatic Mode Inferencing for Prolog Programs
8. Inductive Assertion Method for Logic Programs
9. A Semantics Based Framework for the Abstract Interpretation of Prolog
10. Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation
11. Bottom-Up Abstract Interpretation of Logic Programs
12. Some Global Optimizations for a Prolog Compiler
13. Abstract Interpretation of Prolog Programs
14. The Design of the Gier Algol Compiler, Part II
15. Finite Fixed-point Problems
16. Calculating Properties of Programs by Valuation on Specific Models
17. Abstract Interpretation of Logic Programs