Optimization Under the Perspective of Soundness, Completeness, and Reusability - Correct System Design: Recent Insights and Advances - page 303

References

1. M. Auslander and M. Hopkins. An overview of the PL.8 compiler. In Proceedings
of the ACM SIGPLAN Symposium on Compiler Construction ( SCC'82 )( Boston,
Massachusetts ), volume 17 ,6of ACM SIGPLAN Notices , pages 22 { 31, 1982.
2. S. Benkner, S. Andel, R. Blasko, P. Brezany, A. Celic, B. M. Chapman, M. Egg,
T. Fahringer, J. Hulman, E. Kelc, E. Mehofer, H. Moritsch, M. Paul, K. Sanjari,
V. Sipkova, B. Velkov, B. Wender, and H. P. Zima. Vienna Fortran Compilation
System - Version 1.2 - User's Guide . Institute for Software Technology and Parallel
Systems, University of Vienna, Vienna, Austria, 1996.
3. P. Cousot. Abstract interpretation. ACM Computing Surveys , 28(2):324 { 328,
1996.
4. P. Cousot and R. Cousot. Abstract interpretation: A unied lattice model for static
analysis of programs by construction or approximation of xpoints. In Conference
Record of the 4th Annual Symposium on Principles of Programming Languages
( POPL'77 )( Los Angeles, California ), pages 238 { 252. ACM, New York, 1977.
5. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In
Conference Record of the 6th Annual Symposium on Principles of Programming
Languages ( POPL'79 )( San Antonio, Texas ), pages 269 { 282. ACM, New York,

1979.
6. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic

and Computation , 2(4):511 { 547, 1992.
7. K.-H. Drechsler and M. P. Stadel. A variation of Knoop, Ruthing and Steen's
LAZY CODE MOTION. ACM SIGPLAN Notices , 28(5):29 { 38, 1993.
8. M. S. Hecht. Flow Analysis of Computer Programs . Elsevier, North-Holland, 1977.
9. J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta

Informatica , 7:305 { 317, 1977.
10. G. A. Kildall. A unied approach to global program optimization. In Conference
Record of the 1st Annual Symposium on Principles of Programming Languages
( POPL'73 )( Boston, Massachusetts ), pages 194 { 206. ACM, New York, 1973.
11. M. Klein, J. Knoop, D. Koschutzki, and B. Steen. DFA&OPT- M eta Frame :Atool
kit for program analysis and optimization. In Proceedings of the 2nd International
Workshop on Tools and Algorithms for the Construction and Analysis of Systems
( TACAS'96 )( Passau, Germany ), Lecture Notes in Computer Science, vol. 1055,
pages 422 { 426. Springer-Verlag, Heidelberg, Germany, 1996.
12. J. Knoop. Eliminating partially dead code in explicitly parallel programs. The-
oretical Computer Science , 196(1-2):365 { 393, 1998.

(Special issue devoted to

Euro-Par'96 ).
13. J. Knoop. Formal callability and its relevance and application to interprocedural
data-flow analysis. In Proceedings of the 6th IEEE Computer Society 1998 Inter-
national Conference on Computer Languages ( ICCL'98 )( Chicago, Illinois ), pages
252 { 261. IEEE Computer Society, Los Alamitos, 1998.
14. J. Knoop. Optimal Interprocedural Program Optimization: A new Framework and
its Application. PhD thesis. University of Kiel, Germany, 1993 . Lecture Notes in
Computer Science Tutorial, vol. 1428, Springer-Verlag, Heidelberg, Germany, 1998.
15. J. Knoop. From DFA-frameworks to DFA-generators: A unifying multiparadigm
approach. In Proceedings of the 5th International Conference on Tools and Algo-
rithms for the Construction and Analysis of Systems ( TACAS'99 )( Amsterdam,
The Netherlands ), Lecture Notes in Computer Science, vol. 1579, pages 360 { 374.
Springer-Verlag, Heidelberg, Germany, 1999.