Skip to Main content Skip to Navigation

Vers la compilation vérifiée de Sea of Nodes : propriétés et raisonnement sémantiques

Abstract : Optimizing compilers for programming languages have become complex software, and they are hence subject to bugs. This can be dangerous in the context of critical systems such as avionics or health care. This thesis is part of research work on verified optimizing compilers, whose objective is to ensure the absence of such bugs. More precisely, we semantically study a particular SSA intermediate representation, Sea of Nodes, which is notably used in the optimizing compiler HotSpot for Java. The SSA property has already been studied from a semantic point of view on simple intermediate representations in control flow graph form, but the subject of dependencies between instructions has just been skimmed from a formal perspective. This thesis brings a semantic study of transformations of programs in Sea of Nodes form, integrating the flexibility regarding data dependencies between instructions. In particular, redundant zero-check elimination, constant propagation, transformation back to sequential basic block, and SSA destruction are studied. Some of the approached topics, including the formalization of a semantics for Sea of Nodes, are accompanied by a verification using the Coq proof assistant.
Document type :
Complete list of metadatas

Cited literature [72 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, August 31, 2018 - 2:31:06 PM
Last modification on : Wednesday, September 9, 2020 - 3:57:13 AM
Long-term archiving on: : Saturday, December 1, 2018 - 1:37:20 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01865395, version 1


Yon Fernández de Retana. Vers la compilation vérifiée de Sea of Nodes : propriétés et raisonnement sémantiques. Génie logiciel [cs.SE]. Université Rennes 1, 2018. Français. ⟨NNT : 2018REN1S020⟩. ⟨tel-01865395⟩



Record views


Files downloads