ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Electronic Notes in Theoretical Computer Science
Volume 141, Issue 2, 7 December 2005, Pages 33-51
Proceedings of the Fourth International Workshop on Compiler Optimization meets Compiler Verification (COCV 2005)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (313 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2005.02.042    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL

Jan Olaf Blech, Sabine Glesner, Johannes Leitner and Steffen Mülling

Institute for Program Structures and Data Organization, University of Karlsruhe, 76128 Karlsruhe, Germany

Available online 25 November 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Correctness of compilers is a vital precondition for the correctness of the software translated by them. In this paper, we present two approaches for the formalization of static single assignment (SSA) form together with two corresponding formal proofs in the Isabelle/HOL system, each showing the correctness of code generation. Our comparison between the two proofs shows that it is very important to find adequate formalizations in formal proofs since they can simplify the verification task considerably. Our formal correctness proofs do not only verify the correctness of a certain class of code generation algorithms but also give us sufficient, easily checkable correctness criteria characterizing correct compilation results obtained from implementations (compilers) of these algorithms. These correctness criteria can be used in a compiler result checker.

Keywords: formal compiler correctness; SSA representation; optimizing code generation; compiler result checker; Isabelle/HOL


Electronic Notes in Theoretical Computer Science
Volume 141, Issue 2, 7 December 2005, Pages 33-51
Proceedings of the Fourth International Workshop on Compiler Optimization meets Compiler Verification (COCV 2005)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.