A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design and implementation of a certifying compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Efficient Code Certification
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Verification of common interprocedural compiler optimizations using visibly pushdown kleene algebra
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
On the representation of kleene algebras with tests
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An axiomatization of arrays for kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Program analysis and verification based on kleene algebra in Isabelle/HOL
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
NetKAT: semantic foundations for networks
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |
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.