Stack-based typed assembly language
From MaRDI portal
Publication:4460723
DOI10.1017/S0956796802004446zbMath1110.68361OpenAlexW4242659600MaRDI QIDQ4460723
No author found.
Publication date: 29 March 2004
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796802004446
Related Items (20)
Certifying low-level programs with hardware interrupts and preemptive threads ⋮ TWAM: a certifying abstract machine for logic programs ⋮ ANF preserves dependent types up to extensional equality ⋮ Polymorphic typed defunctionalization and concretization ⋮ Formal compiler construction in a logical framework ⋮ Certifying assembly programs with trails ⋮ A formally verified compiler back-end ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ A type system with subtyping for WebAssembly's stack polymorphism ⋮ A list-machine benchmark for mechanized metatheory ⋮ Function extraction ⋮ Modular development of certified program verifiers with a proof assistant, ⋮ A new type system for JVM lock primitives ⋮ Abstraction-carrying code: a model for mobile code safety ⋮ Unnamed Item ⋮ Type-based hot swapping of running modules ⋮ Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ A Representation of Fω in LF ⋮ Automated techniques for provably safe mobile code.
Uses Software
This page was built for publication: Stack-based typed assembly language
