Formal verification of translation validators: a case study on instruction scheduling optimizations

  • Authors:
  • Jean-Baptiste Tristan;Xavier Leroy

  • Affiliations:
  • INRIA Paris-Rocquencourt, Rocquencourt, France;INRIA Paris-Rocquencourt, Rocquencourt, France

  • Venue:
  • Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of itssemantics. This approach can be used in a verified compiler, provided that validation is formally proved to be correct. We present two such validators and their Coq proofs of correctness. The validators are designed for two instruction scheduling optimizations: list scheduling and trace scheduling.