[I2 logo] [RWTH logo] MOVES: Software Modeling and Verification
(Informatik 2)
Computer Science / RWTH / I2 / Teaching / Seminar / PACO2005
Printer-friendly

Seminar: Programmanalyse und Compileroptimierung

Sommersemester 2005

Inhalt

Dieses Seminar vertieft die Vorlesung Programmanalyse und Compileroptimierung aus dem Wintersemester 2004/05.

Voraussetzung

Vordiplom, Vorlesung über Programmanalyse und Compileroptimierung.

Zuordnung

Theoretische Informatik, Vertiefungsfach Implementierung von Programmiersprachen

Termine

Das Seminar findet am 25. und 26. Juli 2005 (Mo./Di.) im Raum 6019 ab 9:00 statt.

Themen

Zeit#ThemaLiteraturBetreuer
Am 25.7.:
9:00Timo BoettcherStatic Single Assignment (SSA)-Form am Beispiel von Java Bytecode[AvRF05], [GPF05]Volker Stolz
10:00Julie WagnerGlobal Value Numbering[AWZ88]Volker Stolz
11:00Emmanuel MüllerPartial Dead Code Elimination[KRS94]Volker Stolz
14:00Deniz ÖzmenRematerialization[BCT92]Volker Stolz
15:00Nils-Per SteinmannInlining[GP02]Thomas Noll
Am 26.7.:
9:00Chengzhi XueValidating More Loop Optimizations[HBGP05]Volker Stolz
10:00Nicolai ViolSlicing Software for Model Construction (MC)[HDZ00]Michael Weber
11:00Arnd HannemannProving Correctness of Compiler Optimizations by Temporal Logic (MC)[LJVWF02]Michael Weber

Literatur

[AvRF05]
W.Amme, J.von Ronne, M.Franz: Quantifying the Benefits of SSA-Based Mobile Code. 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV'05), Edinburgh, Scotland; April 2005
[AWZ88]
B.Alpern, M.N.Wegman, F.K.Zadeck: Detecting Equality of Variables in Programs. Proc. of the 15th Annual ACM Symposium on Principles of Programming Languages (POPL'88), 1988
[Bla99]
B. Blanchet: Escape analysis for object-oriented languages: application to Java, Conference on Object Oriented Programming Systems Languages and Applications, ACM Press, 1999, 20-34
[BSF04]
M.Q. Beers, C.H. Stork, M. Franz: Efficiently Verifiable Escape Analysis, ECOOP 2004, LNCS 3086, 2004, 75-95
[BCT92]
P.Briggs, K.D.Cooper, L.Torczon: Rematerialization. Proc. of the SIGPLAN 92 Conference on Programming Language Design and Implementation (PLDI'92), SIGPLAN Notices 27(7), p.311-321, 1992
[DGC95]
J. Dean, D. Grove, C. Chambers: Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis, Proceedings of the 9th European Conference on Object-Oriented Programming, LNCS 952, 1995, 77-101
[GPF05]
A.Gal, Ch.W.Probst, M.Franz: Structural Encoding of Static Single Assignment Form. 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV'05), Edinburgh, Scotland; April 2005
[GP02]
N. Glew, J. Palsberg: Type-Safe Method Inlining, Proceedings of the 16th European Conference on Object-Oriented Programming, LNCS 2374, 2002, 525-544
[HBGP05]
Y.Hu, C.Barrett, B.Goldberg, A.Pnueli: Validating More Loop Optimizations. Proc. of the 4th International Workshop on Compiler Optimization Meets Compiler Verification (COCV'05), ENTCS, 2005
[HDZ00]
J.Hatcliff, M.B.Dwyer, H.Zheng: Slicing Software for Model Construction. J. Higher Order Symbol. Comput. 13(4):315-353, 2000
[KRS94]
J.Knoop, O.Rüthing, B.Steffen: Partial Dead Code Elimination. Proc. of the SIGPLAN 94 Conference on Programming Language Design and Implementation (PLDI'94), SIGPLAN Notices 29(6), p.147-158, 1994
[LJVWF02]
D.Lacey, N.D.Jones, E.Van Wyk, C.F.Frederiksen: Proving Correctness of Compiler Optimizations by Temporal Logic. Proc. of the 29th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'02), 2002
[MOR01]
M.Müller-Olm, O.Rüthing: On the Complexity of Constant Propagation. In D.Sands (ed.): 10th European Symposium on Programming (ESOP 2001), LNCS Vol.2028, 190-205, Springer, 2001
[MD00]
R.Muth, S.Debray: On the Complexity of Flow-Sensitive Dataflow Analyses. Proc. of the 27th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'00), 2000

Hinweise zu Ausarbeitung und Vortrag

Valid HTML 4.01 Strict! Valid CSS!