Formalizing the LLVM intermediate representation for verified program transformations
From MaRDI portal
Publication:2942893
Recommendations
- Formal verification of a C-like memory model and its uses for verifying program transformations
- A Framework for Formal Verification of Compiler Optimizations
- Verifying optimizations for concurrent programs
- Mechanized verification of computing dominators for formalizing compilers
- A formally verified compiler back-end
Cited in
(16)- Transforming concurrent programs with semaphores into logically constrained term rewrite systems
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey
- Leveraging compiler intermediate representation for multi- and cross-language verification
- A modeling concept for formal verification of OS-based compositional software
- Proving Termination of C Programs with Lists
- Automatically proving termination and memory safety for programs with pointer arithmetic
- A linear first-order functional intermediate language for verified compilers
- Vellvm
- Cogent: uniqueness types and certifying compilation
- Mechanized verification of computing dominators for formalizing compilers
- Grounding game semantics in categorical algebra
- LCTD: test-guided proofs for C programs on LLVM
- Trace-relating compiler correctness and secure compilation
- A formal semantics of the GraalVM intermediate representation
- Verifying constant-time implementations by abstract interpretation
- scientific article; zbMATH DE number 7649971 (Why is no real title available?)
This page was built for publication: Formalizing the LLVM intermediate representation for verified program transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942893)