Skip to Main content Skip to Navigation
New interface
Conference papers

Formally Verified Superblock Scheduling

Abstract : On in-order processors, without dynamic instruction scheduling, program running times may be significantly reduced by compile-time instruction scheduling. We present here the first effective certified instruction scheduler that operates over superblocks (it may move instructions across branches), along with its performance evaluation. It is integrated within the CompCert C compiler, providing a complete machine-checked proof of semantic preservation from C to assembly. Our optimizer composes several passes designed by translation validation: program transformations are proposed by untrusted oracles, which are then validated by certified and scalable checkers. Our main checker is an architecture-independent simulation-test over superblocks modulo register liveness, which relies on hash-consed symbolic execution.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03200774
Contributor : Sylvain Boulmé Connect in order to contact the contributor
Submitted on : Saturday, December 11, 2021 - 7:36:12 AM
Last modification on : Wednesday, March 16, 2022 - 3:44:18 AM

File

hal_prepass_scheduling.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Cyril Six, Léo Gourdin, Sylvain Boulmé, David Monniaux, Justus Fasse, et al.. Formally Verified Superblock Scheduling. Certified Programs and Proofs (CPP ’22), Jan 2022, Philadelphia, United States. ⟨10.1145/3497775.3503679⟩. ⟨hal-03200774v2⟩

Share

Metrics

Record views

430

Files downloads

263