


default search action
4th COCV@ETAPS 2005: Edinburgh, UK
- Jens Knoop, George C. Necula, Wolf Zimmermann:
Proceedings of the Fourth International Workshop on Compiler Optimization meets Compiler Verification, COCV@ETAPS 2005, Edinburgh, UK, April 3, 2005. Electronic Notes in Theoretical Computer Science 141(2), Elsevier 2005 - Jens Knoop, George C. Necula, Wolf Zimmermann:
Preface. 1-3 - Hans Langmaack:
What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer?: Auf Deutsch: Welche Art mathematischer Argumentation darf die Informatikwissenschaft einem Softwareimplementierer auf jeden Fall zumuten? 5-32 - Jan Olaf Blech
, Sabine Glesner, Johannes Leitner, Steffen Mülling:
Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL. 33-51 - Alexandru Salcianu, Konstantine Arkoudas:
Machine-Checkable Correctness Proofs for Intra-procedural Dataflow Analyses. 53-68 - Ying Hu, Clark W. Barrett
, Benjamin Goldberg, Amir Pnueli:
Validating More Loop Optimizations. 69-84 - Andreas Gal, Christian W. Probst
, Michael Franz:
Structural Encoding of Static Single Assignment Form. 85-102 - Wolfram Amme, Jeffery von Ronne
, Michael Franz:
Quantifying the Benefits of SSA-Based Mobile Code. 103-119

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.