A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Validating Dominator Trees for a Fast, Verified Dominance Test
[chapter]
2015
Lecture Notes in Computer Science
The problem of computing dominators in a control flow graph is central to numerous modern compiler optimizations. Many efficient algorithms have been proposed in the litterature, but mechanizing the correctness of the most sophisticated algorithms is still considered as too hard problems, and to this date, verified compilers use less optimized implementations. In contrast, production compilers, like GCC or LLVM, implement the classic, efficient Lengauer-Tarjan algorithm [12] , to compute
doi:10.1007/978-3-319-22102-1_6
fatcat:noeesvjn4zcflllnp2ecc4z2da