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

Authors:
Jan Olaf Blech;Sabine Glesner;Johannes Leitner;Steffen Mülling
Affiliations:
Institute for Program Structures and Data Organization, University of Karlsruhe, 76128 Karlsruhe, Germany;Institute for Program Structures and Data Organization, University of Karlsruhe, 76128 Karlsruhe, Germany;Institute for Program Structures and Data Organization, University of Karlsruhe, 76128 Karlsruhe, Germany;Institute for Program Structures and Data Organization, University of Karlsruhe, 76128 Karlsruhe, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 11
Cited 7

A mechanically verified language implementation

Journal of Automated Reasoning
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that

Term rewriting and all that
Advanced compiler design and implementation

Advanced compiler design and implementation
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Verified Lexical Analysis

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Formal Verification of a Java Compiler in Isabelle

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Into the Loops: Practical Issues in Translation Validation for Optimizing Compilers

Electronic Notes in Theoretical Computer Science (ENTCS)

A Formally Verified Compiler Back-end

Journal of Automated Reasoning
Formal verification with Isabelle/HOL in practice: finding a bug in the GCC scheduler

FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Certifying compilers using higher-order theorem provers as certificate checkers

Formal Methods in System Design
On the correctness of transformations in compiler back-ends

ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
A formally verified SSA-Based middle-end: Static single assignment meets compcert

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Formal verification of SSA-based optimizations for LLVM

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Formal Verification of an SSA-Based Middle-End for CompCert

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.