Validating Dominator Trees for a Fast, Verified Dominance Test

DOI10.1007/978-3-319-22102-1_6zbMath1466.68030OpenAlexW1614049895MaRDI QIDQ2945625

Sandrine Blazy, Delphine Demange, David Pichardie

Publication date: 14 September 2015

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01193281/file/main.pdf

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

A Fast Verified Liveness Analysis in SSA Form ⋮ Efficient computation of arbitrary control dependencies

Uses Software

• Coq

This page was built for publication: Validating Dominator Trees for a Fast, Verified Dominance Test