Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch this 21-minute conference presentation from CPP 2026 that explores the formal verification of dominator tree algorithms in compiler optimization. Learn about the implementation and proof of correctness for a dominator validator in the Rocq Prover within the CompCertSSA verified compiler, representing the first complete mechanized certification of a fast dominator computation algorithm. Discover how modern compiler optimizations and analyses, particularly those based on SSA form, rely on dominance information and why computing dominators efficiently is crucial. Examine the classic Lengauer-Tarjan algorithm from 1979 and understand the challenges in formally verifying fast dominator algorithms that previous works have only partially addressed. Explore the innovative certification method described by Georgiadis and Tarjan in 2016, which defines a certificate that simplifies dominator validation. Gain insights into how this breakthrough work successfully bridges the gap between efficient dominator computation and formal verification, providing a foundation for more reliable compiler optimizations in verified compilation systems.
