Verification of common interprocedural compiler optimizations using visibly pushdown kleene algebra

Authors:
Claude Bolduc;Béchir Ktari
Affiliations:
Département d'informatique et de génie logiciel, Université Laval, Québec, QC, Canada;Département d'informatique et de génie logiciel, Université Laval, Québec, QC, Canada
Venue:
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Year:
2010

Citing 11
Cited 0

A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of Compiler Optimizations Using Kleene Algebra with Tests

CL '00 Proceedings of the First International Conference on Computational Logic
Proof Generation in the Touchstone Theorem Prover

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Efficient Code Certification

Efficient Code Certification
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nonlocal Flow of Control and Kleene Algebra with Tests

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Program analysis for compiler validation

Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visibly pushdown Kleene algebra is an algebraic system using only propositional reasoning while still being able to represent wellknown constructs of programming languages (sequences, alternatives, loops and code blocks) in a natural way. In this paper, this system is used to verify the following interprocedural compiler optimizations: interprocedural dead code elimination, inlining of functions, tail-recursion elimination, procedure reordering and function cloning. The proofs are equational and machine-verifiable.