Formal Verification of Translation Validators -- A Case Study on Instruction Scheduling Optimizations (2008)
by
Jean-baptiste Tristan
,
Xavier Leroy
| Citations: | 17 - 3 self |
BibTeX
@MISC{Tristan08formalverification,
author = {Jean-baptiste Tristan and Xavier Leroy},
title = { Formal Verification of Translation Validators -- A Case Study on Instruction Scheduling Optimizations},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. 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.
