Incremental analysis of constraint logic programs

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 2, 2000, Pages 187-223

  Hermenegildo, Manuel ^a   Puebla, German ^a   Marriott, Kim ^c   Stuckey, Peter J ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c NONE

Author keywords

D.1.2 Programming Techniques : Automatic Programming Automatic analysis of algorithms, Program transformation; D.1.6 Programming Techniques : Logic programming; D.3.4 Programming Languages : Compilers; F.3.1 Logics and Meanings of Programs

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; DATA STORAGE EQUIPMENT; INFORMATION ANALYSIS; MATHEMATICAL TRANSFORMATIONS; PROGRAM COMPILERS; SEARCH ENGINES;

ABSTRACT INTERPRETATION; INCREMENTAL COMPUTATION; STATIC ANALYSIS;

LOGIC PROGRAMMING;

EID: 0037882758     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/349214.349216     Document Type: Article

References (53)

1. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P., AND G H. SØNDERGAARD. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Static Analysis Symposium, SAS'94. Number 864 in LNCS. Springer-Verlag, Namur, Belgium, 266-280.
2. BOSSI, A., GABBRIELI, M., LEVI, G., AND MEO, M. 1994. A compositional semantics for logic programs. Theoretical Computer Science 122, 1,2, 3-47.
3. BRUYNOOGHE, M. 1991. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming 10, 91-124.
4. BUENO, F., CABEZA, D., CARRO, M., HERMENEGILDO, M., LÓPEZ-GARCÍA, P., AND PUEBLA, G. 1997. The Ciao Prolog system. Reference manual. The Ciao System Documentation Series-TR CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM). August.
5. BUENO, F., CABEZA, D., HERMENEGILDO, M., AND PUEBLA, G. 1996. Global analysis of standard Prolog programs. In European Symposium on Programming. Number 1058 in LNCS. Springer-Verlag, Sweden, 108-124.
6. BUENO, F., GARCÍA DE LA BANDA, M. G., AND HERMENEGILDO, M. 1999a. Effectiveness of abstract interpretation in automatic parallelization: A case study in logic programming. ACM Transactions on Programming Languages and Systems 21, 2 (March), 189-238.
7. BUENO, F., GARCÍA DE LA BANDA, M. G., HERMENEGILDO, M., AND MUTHUKUMAR, K. 1999b. Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism. Journal of Logic Programming 38, 2, 165-218.
8. BUENO, F., GARCÍA DE LA BANDA, M., AND HERMENEGILDO, M. 1994. Effectiveness of global analysis in strict independence-based automatic program parallelization. In International Symposium on Logic Programming. MIT Press, Cambridge, Massachusetts, 320-336.
9. BURKE, M. 1990. An interval-based approach to exhaustive and incremental interprocedural dataflow analysis. ACM Transactions on Programming Languages and Systems 12, 3, 341-395.
10. ACM Transactions on Programming Languages and Systems, Vol. 22, No. 2, March 2000.
11. CARROLL, M. AND RYDER, B. 1988. Incremental data flow analysis via dominator and attribute updates. In 15th ACM Symposium on Principles of Programming Languages (POPL). ACM Press, San Diego, 274-284.
12. CHARLIER, B. L. AND VAN HENTENRYCK, P. 1994. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM Transactions on Programming Languages and Systems 16, 1, 35-101.
13. CHARLIER, B. L., DEGIMBE, O., MICHAEL, L., AND VAN HENTENRYCK, P. 1993. Optimization techniques for general purpose fixpoint algorithms: Practical efficiency for the abstract interpretation of Prolog. In Workshop on Static Analysis. Springer-Verlag, 15-26.
14. CHARLIER, B. L., ROSSI, S., AND VAN HENTENRYCK, P. 1994. An abstract interpretation framework which accurately handles Prolog search-rule and the cut. In International Symposium on Logic Programming. MIT Press, 157-171.
15. CODISH, M., DEBRAY, S., AND GIACOBAZZI, R. 1993. Compositional analysis of modular logic programs. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL'93. ACM, Charleston, South Carolina, 451-464.
16. CONERY, J. S. AND KIBLER, D. F. 1981. Parallel interpretation of logic programs. In Proc. of the ACM Conference on Functional Programming Languages and Computer Architecture. (1981). ACM Press, 163-170.
17. COOPER, K. AND KENNEDY, K. 1984. Efficient computation of flow insensitive interprocedural summary information. In ACM SIGPLAN Symposium on Compiler Construction (SIGPLAN Notices 19(6)). ACM Press, 247-258.
18. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Fourth ACM Symposium on Principles of Programming Languages. ACM Press, Los Angeles, 238-252.
19. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Sixth ACM Symposium on Principles of Programming Languages. ACM Press, San Antonio, Texas, 269-282.
20. DEBRAY, S., Ed. 1992. Journal of Logic Programming, Special Issue: Abstract Interpretation. Vol. 13(1-2). North-Holland, Amsterdam.
21. DEBRAY, S. K. 1989. Static inference of modes and data dependencies in logic programs. ACM Transactions on Programming Languages and Systems 11, 3, 418-450.
22. ENGLEBERT, V., LE CHARLIER, B., ROLAND, D., AND VAN HENTENRYCK, P. 1993. Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation. Software Practice and Experience 23, 4 (Apr.), 419-459.
23. GARCÍA DE LA BANDA, M., MARRIOTT, K., SØNDERGAARD, H., AND STUCKEY, P. 1998. Differential methods in logic program analysis. Journal of Logic Programming 35, 1, 1-37.
24. HERMENEGILDO, M. AND GREENE, K. 1991. The &-Prolog system: Exploiting independent and-parallelism. New Generation Computing 9, 3,4, 233-257.
25. HERMENEGILDO, M. AND ROSSI, F. 1995. Strict and non-strict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions. Journal of Logic Programming 22, 1, 1-45.
26. HERMENEGILDO, M., BUENO, F., PUEBLA, G., AND LÓPEZ-GARCÍA, P. 1999a. Program analysis, debugging and optimization using the Ciao system preprocessor. In 1999 International Conference on Logic Programming. MIT Press, Cambridge, MA, 52-66.
27. HERMENEGILDO, M., PUEBLA, G., AND BUENO, F. 1999b. Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging. In The Logic Programming Paradigm: a 25-Year Perspective, K. R. Apt, V. Marek, M. Truszczynski, and D. S. Warren, Eds. Springer-Verlag, 161-192.
28. HERMENEGILDO, M., PUEBLA, G., MARRIOTT, K., AND STUCKEY, P. 1995. Incremental analysis of logic programs. In International Conference on Logic Programming. MIT Press, 797-811.
29. HERMENEGILDO, M., WARREN, R., AND DEBRAY, S. K. 1992. Global flow analysis as a practical compilation tool. Journal of Logic Programming 13, 4 (August), 349-367.
30. KELLY, A., MACDONALD, A., MARRIOTT, K., SØNDERGAARD, H., AND STUCKEY, P. 1998a. Optimizing compilation for CLP(ℛ). ACM Transactions on Programming Languages and Systems 20, 6, 1223-1250.
31. KELLY, A., MARRIOTT, K., SØNDERGAARD, H., AND STUCKEY, P. 1998b. A practical object-oriented analysis engine for CLP. Software: Practice and Experience 28, 2, 199-224.
32. KRALL, A. AND BERGER, T. 1995a. Incremental global compilation of Prolog with the Vienna abstract machine. In International Conference on Logic Programming. MIT Press, Tokyo, 333-347.
33. AI - an abstract machine for incremental global dataflow analysis of Prolog. In ICLP'95 Post-Conference Workshop on Abstract Interpretation of Logic Languages, M. G. de la Banda, G. Janssens, and P. Stuckey, Eds. Science University of Tokyo, Tokyo, 80-91.
34. MARLOWE, T. AND RYDER, B. 1990. An efficient hybrid algorithm for incremental data flow analysis. In 17th ACM Symposium on Principles of Programming Languages (POPL). ACM Press, San Francisco, 184-196.
35. MARRIOTT, K. AND STUCKEY, P. 1998. Programming with Constraints: an Introduction. MIT Press.
36. MARRIOTT, K., SØNDERGAARD, H., AND JONES, N. 1994. Denotational abstract interpretation of logic programs. ACM Transactions on Programming Languages and Systems 16, 3, 607-648.
37. MUTHUKUMAR, K. AND HERMENEGILDO, M. 1990. Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs. Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759. April.
38. MUTHUKUMAR, K. AND HERMENEGILDO, M. 1991. Combined determination of sharing and freeness of program variables through abstract interpretation. In 1991 International Conference on Logic Programming. MIT Press, Paris, 49-63.
39. MUTHUKUMAR, K. AND HERMENEGILDO, M. 1992. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming 13, 2/3 (July), 315-347. Originally published as Technical Report FIM 59.1/IA/90, Computer Science Dept, Universidad Politecnica de Madrid, Spain, August 1990.
40. POLLOCK, L. AND SOFFA, M. 1989. An incremental version of iterative data flow analysis. IEEE Transactions on Software Engineering 15, 12, 1537-1549.
41. PUEBLA, G. AND HERMENEGILDO, M. 1995. Implementation of multiple specialization in logic programs. In Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation. ACM Press, La Jolla, California, 77-87.
42. PUEBLA, G. AND HERMENEGILDO, M. 1996. Optimized algorithms for the incremental analysis of logic programs. In International Static Analysis Symposium. Number 1145 in LNCS. Springer-Verlag, 270-284.
43. PUEBLA, G. AND HERMENEGILDO, M. 1999. Abstract multiple specialization and its application to program parallelization. J. of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs 41, 2&3 (November), 279-316.
44. PUEBLA, G. AND HERMENEGILDO, M. 2000. Some issues in analysis and specialization of modular Ciao-Prolog programs. Electronic Notes in Theoretical Computer Science 30, 2 (March). Special Issue on Optimization and Implementation of Declarative Programming Languages.
45. PUEBLA, G., BUENO, F., AND HERMENEGILDO, M. 2000. A generic preprocessor for program validation and debugging. In Analysis and Visualization Tools for Constraint Programming, P. Deransart, M. Hermenegildo, and J. Maluszynski, Eds. Springer-Verlag. To appear.
46. RAMALINGAM, G. AND REPS, T. 1993. A categorized bibliography on incremental computation. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL'93. ACM, Charleston, South Carolina.
47. ROSEN, B. 1981. Linear cost is sometimes quadratic. In Eighth ACM Symposium on Principles of Programming Languages (POPL). ACM Press, Williamsburg, Virginia, 117-124.
48. RYDER, B. 1988. Incremental data-flow analysis algorithms. ACM Transactions on Programming Languages and Systems 10, 1, 1-50.
49. RYDER, B., MARLOWE, T., AND PAULL, M. 1988. Conditions for incremental iteration: Examples and counterexamples. Science of Computer Programming 11, 1, 1-15.
50. SANTOS-COSTA, V., WARREN, D., AND YANG, R. 1991. The Andorra-I preprocessor: Supporting full Prolog on the basic Andorra model. In 1991 International Conference on Logic Programming. MIT Press, Paris, 443-456.
51. TARJAN, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 140-160.
52. VAN ROY, P. AND DESPAIN, A. 1992. High-performace logic programming with the aquarius Prolog compiler. IEEE Computer Magazine 25, 1 (January), 54-68.
53. WINSBOROUGH, W. 1992. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming 13, 1 and 3 (July), 259-290.