Differential methods in logic program analysis

Journal of Logic Programming

Volumn 35, Issue 1, 1998, Pages 1-37

  García De La Banda, Maria ^a   Marriott, Kim ^a   Stuckey, Peter ^b   Søndergaard, Harald ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; PROGRAM COMPILERS; PROGRAM DEBUGGING;

LOGIC PROGRAM ANALYSIS;

LOGIC PROGRAMMING;

EID: 0032049309     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10002-4     Document Type: Article

References (22)

1. M. Bruynooghe, A practical framework for the abstract interpretation of logic programs, Journal of Logic Programming 10 (2) (1991) 91-124.
2. F. Bueno, M. García de la Banda, M. Hermenegildo, Effectiveness of global analysis in strict independence-based automatic parallelization, in: M. Bruynooghe (Ed.), Proceedings of 1994 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 320-336.
3. M. Codish, M. García de la Banda, M. Bruynooghe, M. Hermenegildo, Goal dependent versus goal independent analysis of logic programs, in: F. Pfenning (Ed.), Proceedings of Fifth International Conference on Logic Programming and Automated Reasoning (Lecture Notes in Artificial Intelligence 822). Springer, Berlin, 1994, pp. 305-320.
4. P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of Fourth Annual ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1977, pp. 238-252.
5. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Proceedings of Sixth Annual ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1979, pp. 269-282.
6. V. Dumortier, Freeness and related analyses of constraint logic programs using abstract interpretation. Ph.D. Thesis, Catholic University of Leuven, Belgium (1994).
7. V. Dumortier, G. Janssens, M. Bruynooghe, M. Codish, Freeness analysis in the presence of numerical constraints, in: D.S. Warren (Ed.), Proceedings of Tenth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 100-115.
8. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, A new declarative semantics for logic languages, in: R. Kowalski, K. Bowen (Eds.), Proceedings of Fifth International Conference Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 993-1005.
9. M. García de la Banda, M. Hermenegildo, K. Marriott, Independence in constraint logic programs, in: D. Miller (Ed.), Proceedings of 1993 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 130-146.
10. M. García de la Banda, K. Marriott, P. Stuckey, Efficient analysis of logic programs with dynamic scheduling, in: J. Lloyd (Ed.), Proceedings of 1995 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 417-431.
11. D. Jacobs, A. Langen, Static analysis of logic programs for independent and-parallelism, Journal of Logic Programming 13 (2 & 3) (1992) 291-331.
12. J. Jaffar, M. Maher, Constraint logic programming: A survey, Journal of Logic Programming 19/20 (1994) 503-581.
13. N. Jones, H. Søndergaard, A semantics-based framework for the abstract interpretation of Prolog, in: S. Abramsky, C. Hankin (Eds.), Abstract Interpretation of Declarative Languages, Ellis Horwood, Chichester, UK, 1987, pp. 123-142.
14. A. Kelly, A. Macdonald, K. Marriott, H. Søndergaard, P. Stuckey, R. Yap, An optimizing compiler for CLP(R), in: U. Montanari, F. Rossi (Eds.), Principles and Practice of Constraint Programming-CP'95, Lecture Notes in Computer Science, 976, Springer, Berlin, 1995, pp. 222-239.
15. B. Le Charlier, P. Van Hentenryck, Experimental evaluation of generic abstract interpretation algorithm for Prolog, ACM Transactions on Programming Languages and Systems 16 (1) (1994) 35-101.
16. K. Marriott, H. Søndergaard, N. Jones, Denotational abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems 16 (3) (1994) 607-648.
17. K. Marriott, P. Stuckey, Approximating interaction between linear arithmetic constraints, in: M. Bruynooghe (Ed.), Proceedings of 1994 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 571-585.
18. A. Mulkers, Live Data Structures in Logic Programs, Lecture Notes in Computer Science, vol. 675, Springer, Berlin, 1993.
19. K. Muthukumar, M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming 13 (2 & 3) (1992) 315-347.
20. H. Søndergaard, An application of abstract interpretation of logic programs: Occur check reduction, in: B. Robinet, R. Wilhelm (Eds.), Proceedings of ESOP 86, Lecture Notes in Computer Science, vol. 213, Springer, Berlin, 1986, pp. 327-338.
21. A. Taylor, LIPS on a MIPS: Results from a Prolog compiler for a RISC, in: D. Warren, P. Szeredi (Eds.), Proceedings of Seventh International Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 174-185.
22. P. Van Roy, A. Despain, The benefits of global dataflow analysis for an optimizing Prolog compiler, in: S. Debray, M. Hermenegildo (Eds.), Proceedings of North American Conference on Logic Programming, MIT Press., Cambridge, MA, 1990, pp. 501-515.