A practical object-oriented analysis engine for CLP

Software - Practice and Experience

Volumn 28, Issue 2, 1998, Pages 199-224

  Kelly, Andrew D ^a   Marriott, Kim ^a   Søndergaard, Harald ^b   Stuckey, Peter J ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Abstract interpretation; Constraint logic programming; Object oriented; Program analysis

Indexed keywords

ERROR DETECTION; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; PROGRAM DIAGNOSTICS; PROLOG (PROGRAMMING LANGUAGE);

ABSTRACT INTERPRETATION; CONSTRAINT LOGIC PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0031996771     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(199802)28:2<199::AID-SPE150>3.0.CO;2-4     Document Type: Article

References (26)

1. A. Kelly, K., Marriott, P. Stuckey and H. Søndergaard, A generic object-oriented incremental analyzer for constraint logic programs, Proc. 20th Australasian Computer Science Conference, pp. 92-101. Australian Computer Science Communications, 1997.
2. J. Jaffar, S. Michaylov, P. Stuckey and R. Yap, An abstract machine for CLP(R), Proc. ACM Conf. Programming Language Design and Implementation, pp. 128-139. ACM Press, 1992.
3. N. Jørgensen, K. Marriott and S. Michaylov, Some global compile-time optimizations for CLP(R), in V. Saraswat and K. Ueda, editors, Logic Programming: Proc. 1991 Int. Symp., pp. 420-434. MIT Press, 1991.
4. A. Macdonald, P. Stuckey and R. Yap, Redundancy of variables in CLP(R), Logic Programming: Proc. 1993 Int. Symp., pp. 75-93. MIT Press, 1993.
5. K. Marriott, H. Søndergaard, P. Stuckey and R. Yap, Optimizing compilation for CLP(R), in G. Gupta, editor, Proc. Seventeenth Australian Computer Science Conf., Australian Computer Science Comm. 16 (1), 551-560 (1994).
6. K. Marriott and P. Stuckey, The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. Proc. Twentieth ACM Symp. Principles of Programming Languages, pp. 334-344. ACM Press, 1993.
7. A. Kelly, A. Macdonald, K. Marriott, H. Søndergaard, P. Stuckey and R. Yap, An optimizing compiler for CLP(R), Proc First Int. Conf. Principles and Practice of Constraint Programming, (Lecture Notes in Computer Science 976), pp. 222-239. Springer-Verlag, 1995.
8. A. Kelly, A. Macdonald, K. Marriott, P. Stuckey and R. Yap, Effectiveness of Optimizing Compilation for CLP(R), in M. Maher, editor, Logic Programming: Proc Thirteenth Joint Int. Conf. and Symp. on Logic Programming, pp. 37-51, MIT Press, 1996.
9. H. Søndergaard, An application of abstract interpretation of logic programs: Occur check reduction, in B. Robinet and R. Wilhelm, editors, Proc. ESOP 86 (Lecture Notes in Computer Science 213), pp. 327-338. Springer-Verlag, 1986.
10. L. Crnogorac, A. Kelly and H. Søndergaard, A comparison of three occur-check analysers, in R. Cousot and D. Schmidt, editors, Proc. Third Int. Static Analysis Symp. (Lecture Notes in Computer Science 1145), pp. 159-173, Springer-Verlag, 1996.
11. M. Hermenegildo, K. Marriott, G. Puebla and P. Stuckey, Incremental analysis of logic programs. Proc. Twelfth Int. Conf. on Logic Programming, pp. 797-811, MIT Press, 1995.
12. K. Muthukumar and M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming, 13 (2&3), 315-347 (1992).
13. V. Englebert, B. Le Charlier, D. Roland and P. Van Hentenryck, Generic abstract interpretation algorithms for Prolog: two optimization techniques and their experimental evaluation, Journal of Software - Practice and Experience, 23 (4), 419-459 (1993).
14. H. Aït-Kaci, Warren's Abstract Machine: A Tutorial Reconstruction, MIT Press, 1991.
15. B. Le Charlier and P. Van Hentenryck, Experimental evaluation of a generic abstract interpretation algorithm for Prolog, ACM Transactions on Programming Languages and Systems 16 (1): 35-101, 1994.
16. P. Cousot and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proc. Fourth Ann. ACM Symp. Principles of Programming Languages, pp. 238-252. ACM Press, 1977.
17. P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proc. Sixth Ann. ACM Symp. of Priciples of Programming Languages, pp. 269-282, 1979.
18. P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Proc. Workshop on Static Analysis of Equational, Functional, and Logic Programs, Bordeaux, France, October 1991.
19. G. Janssens and W. Simoens, On the implementation of abstract interpreation systems for (constraint) logic programs, Compiler Construction, 5th International Conference, CC '94 (Lecture Notes in Computer Science 786). Springer-Verlag, 1994.
20. A. Cortesi and G, File, Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, Proc. ACM SIGPLAN Symp. Partial Evaluation and Semantics Based Program Manipulation, pp. 52-61. ACM, 1991.
21. V. Dumortier, G. Janssens, M. Bruynooghe and M. Codish, Freeness analysis in the presence of numerical constraints, Proc. Tenth Int. Conf. On Logic Programming, pp. 100-115, MIT Press, 1993.
22. M. Hanus, Compile-time analysis of nonlinear constraints in CLP(R), New Generation Computing, 13 (2) 1995.
23. T. Armstrong, K. Marriott, P. Schachte and H. Søndergaard, Boolean functions for dependency analysis: Algebraic properties and efficient representation, in B. Le Charlier, editor, Static Analysis: Proc. First Int. Symp. (Lecture Notes in Computer Science 864), pp. 266-280. Springer-Verlag, 1994.
24. S. Debray, Static inference of modes and data dependencies in logic programs, ACM Transactions on Programming Languages and Sy stems, 11 (3), 418-450 (1989).
25. K. Marriott, H. Søndergaard and N. D. Jones, Denotational abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems, 16(3), 607-648 (1994).
26. G. Puebla and M. Hermenegildo, Optimized algorithms for incremental analysis of logic programs in R. Cousot and D. Schmidt, editors, Proc. Third Int. Static Analysis Symp. (Lecture Notes in Computer Science 1145), pp. 270-284. Springer-Verlag, 1996.