A Typed, Compositional Logic for a Stack-Based Abstract Machine
Abstract elided by the publisher.
Related papers
- An abstract stack based approach to verified compositional compilation to machine code POPL 2019
- Bimodels and Biorthogonality for Abstract Machines ICFP 2026
- Le temps des cerises: efficient temporal stack safety on capability machines using directed capabilities OOPSLA 2022
- Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines CPP 2019
- A Complete Program Logic for Compositional Linearizability ECOOP 2026
- Control-flow analysis of function calls and returns by abstract interpretation ICFP 2009
- Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine APLAS 2018
- TLC: temporal logic of distributed components ICFP 2020