Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra

DOI10.1007/978-3-642-17796-5_2zbMath1308.68036OpenAlexW1487924811MaRDI QIDQ3067464

Claude Bolduc, Béchir Ktari

Publication date: 21 January 2011

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17796-5_2

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra

Uses Software

• TALx86

Cites Work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra
• Visibly pushdown languages
• Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs
• Stack-based typed assembly language
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra