Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
From MaRDI portal
Recommendations
- Certification of compiler optimizations using Kleene algebra with tests
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Verification of the correctness of compiler optimization using co-induction
- Relational Methods in Computer Science
- Specification, verification and prototyping of an optimized compiler
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Certification of compiler optimizations using Kleene algebra with tests
- Kleene algebra with tests: Completeness and decidability
- Proof generation in the Touchstone theorem prover
- Stack-based typed assembly language
- Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Visibly pushdown languages
Cited in
(4)- Certification of compiler optimizations using Kleene algebra with tests
- Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Verification of the correctness of compiler optimization using co-induction
This page was built for publication: Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067464)