Certification of Compiler Optimizations Using Kleene Algebra with Tests

We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimination of redundant instructions, array bounds check elimination, and introduction of sentinels. In each of these cases, we give a formal equational proof of the correctness of the optimizing transformation.

• Type: Conference
• Year: 2000
• Where: CL
• Authors: Dexter Kozen, Maria-Christina Patron
• Keywords: Automated Reasoning, CL 2000, Common Subexpression Elimination, Dead Code Elimination, Induction Variable Elimination