A model for inter-module analysis and optimizing compilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2042 LNCS, Issue , 2001, Pages 86-102

  Bueno, Francisco ^a   De La Banda, Maria Garcia ^b   Hermenegildo, Manuel ^a   Marriott, Kim ^b   Puebla, German ^a   Stuckey, Peter J ^c  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b MONASH UNIVERSITY   (Australia)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; SYNTHESIS (CHEMICAL);

CONTEXT-SENSITIVE PROGRAMS; INTER-MODULE; OPTIMIZING COMPILATION; PROGRAM ANALYSIS; RECENT RESEARCHES; SEPARATE COMPILATION; SIMPLE MODELING; SPEED UP;

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

EID: 84879487490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45142-0_6     Document Type: Conference Paper

References (20)

1. T. Armstrong, K. Marriott, P. J. Schachte, and H. Sndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium, B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266-280, 1994. 88, 98
2. F. Bueno, M. Garc?a de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. J. Stuckey. Inter-module Analysis and Optimizing Compilation. Department of Computer Science and Software Engineering, University of Melbourne, Forthcoming Technical Report, 2001. 93
3. F. Bueno, M. Garc?a de la Banda, M. Hermenegildo, and K. Muthukumar. Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism. Journal of Logic Programming 38, 2, 165-218. 86
4. M. Codish, S. K. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL'93, pages 451-464, Charleston, South Carolina, 1993. ACM. 87
5. P. Cousot and R. Cousot. 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, 238-252, 1977. 88
6. S. I. Feldman. Make-A program for maintaining computer programs. Software-Practice and Experience, 1979. 87
7. M. Hermenegildo, G. Puebla, K. Marriott, and P. J. Stuckey. Incremental analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems, 22(2):187-223, 2000. 87, 95
8. A. Kelly, A. Macdonald, K. Marriott, H. Sndergaard, and P. J. Stuckey. Optimizing compilation for CLP(R). ACM Transactions on Programming Languages and Systems, 20(6):1223-1250, 1998. 86, 87, 100
9. K. Muthukumar and M. Hermenegildo. Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2/3):315-347, July 1992. 98
10. G. Puebla and M. Hermenegildo. 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):279-316, 1999. 87, 100
11. G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. In [20]. 87
12. A. Rountev, B. G. Ryder, and W. Landi. Data-flow analysis of program fragments. In Proceedings of ESEC/FSE '99, volume 1687 of LNCS, pages 235-252. Springer-Verlag, 1999. 87
13. Z. Shao and A. Appel. Smartest recompilation. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL'93, pages 439-450, Charleston, South Carolina, 1993. ACM. 87
14. R. W. Schwanke and G. E. Kaiser. Smarter recompilation. ACM Transactions on Programming Languages and Systems, 10(4):627-632, 1988. 87
15. Z. Somogyi, F. Henderson and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17-64, 1996. 87
16. W. Tichy. Smart recompilation. ACM Transactions on Programming Languages and Systems, 8(3):273-291, 1986. 87
17. W. Vanhoof and M. Bruynooghe. Towards modular binding-time analysis for firstorder Mercury. In [20].
18. H. Sondergaard. An application of abstract interpretation of logic programs: occur check reduction. In European Symposium on Programming, LNCS 123, pages 327-338. Springer-Verlag, 1986. 98
19. W. Winsborough. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming, 13(2 and 3):259-290, July 1992. 87
20. Special Issue on Optimization and Implementation of Declarative Programming Languages, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier-North Holland, March 2000. 101, 102