On the public citation graph
Modular, compositional, and executable formal semantics for LLVM IR
0 signed · 111 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-63618-0_3openalex-snapshot
Verified Translation Between Purely Functional and Imperative Domain Specific Languages in HELIX
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_24openalex-snapshot
An Axiomatic Specification for Sequential Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-19718-5_1openalex-snapshot
Verified Software Toolchain
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_3openalex-snapshot
Pretty-Big-Step Semantics
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_23openalex-snapshot
Functional Big-Step Semantics
inferredcites →https://doi.org/10.1016/j.ic.2007.12.004openalex-snapshot
Coinductive big-step operational semantics
inferredcites →https://doi.org/10.1016/j.jlap.2010.03.012openalex-snapshot
An overview of the K semantic framework
inferredcites →https://doi.org/10.1023/a:1023064908962openalex-snapshot
Algebraic Operations and Generic Effects
inferredcites →https://doi.org/10.1109/cgo.2017.7863732openalex-snapshot
Formalizing the concurrency semantics of an LLVM fragment
inferredcites →https://doi.org/10.1109/jproc.2018.2873289openalex-snapshot
SPIRAL: Extreme Performance Portability
inferredcites →https://doi.org/10.1145/115372.115320openalex-snapshot
Efficiently computing static single assignment form and the control dependence graph
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/1706299.1706312openalex-snapshot
A verified compiler for an impure functional language
inferredcites →https://doi.org/10.1145/1707801.1706312openalex-snapshot
A verified compiler for an impure functional language
inferredcites →https://doi.org/10.1145/174675.178068openalex-snapshot
Building interpreters by composing monads
inferredcites →https://doi.org/10.1145/1993316.1993532openalex-snapshot
Finding and understanding bugs in C compilers
inferredcites →https://doi.org/10.1145/1993498.1993532openalex-snapshot
Finding and understanding bugs in C compilers
inferredcites →https://doi.org/10.1145/2103621.2103709openalex-snapshot
Formalizing the LLVM intermediate representation for verified program transformations
inferredcites →https://doi.org/10.1145/2429069.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferredcites →https://doi.org/10.1145/2480359.2429093openalex-snapshot
The power of parameterization in coinductive proof
inferredcites →https://doi.org/10.1145/2499370.2462164openalex-snapshot
Formal verification of SSA-based optimizations for LLVM
inferredcites →https://doi.org/10.1145/2535838.2535876openalex-snapshot
A trusted mechanised JavaScript specification
inferredcites →https://doi.org/10.1145/2676724.2693571openalex-snapshot
A Typed C11 Semantics for Interactive Theorem Proving
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2737924.2737965openalex-snapshot
Provably correct peephole optimizations with alive
inferredcites →https://doi.org/10.1145/2737924.2738005openalex-snapshot
A formal C memory model supporting integer-pointer casts
inferredcites →https://doi.org/10.1145/2775051.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2784731.2784764openalex-snapshot
Pilsner: a compositionally verified compiler for a higher-order imperative language
inferredcites →https://doi.org/10.1145/2813885.2737965openalex-snapshot
Provably correct peephole optimizations with alive
inferredcites →https://doi.org/10.1145/2813885.2738005openalex-snapshot
A formal C memory model supporting integer-pointer casts
inferredcites →https://doi.org/10.1145/2837614.2837642openalex-snapshot
Lightweight verification of separate compilation
inferredcites →https://doi.org/10.1145/2858949.2784764openalex-snapshot
Pilsner: a compositionally verified compiler for a higher-order imperative language
inferredcites →https://doi.org/10.1145/2908080.2908081openalex-snapshot
Into the depths of C: elaborating the de facto standards
inferredcites →https://doi.org/10.1145/2914770.2837642openalex-snapshot
Lightweight verification of separate compilation
inferredcites →https://doi.org/10.1145/3062341.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferredcites →https://doi.org/10.1145/3062341.3062372openalex-snapshot
Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM
inferredcites →https://doi.org/10.1145/3140587.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferredcites →https://doi.org/10.1145/3140587.3062372openalex-snapshot
Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3192366.3192377openalex-snapshot
Crellvm: verified credible compilation for LLVM
inferredcites →https://doi.org/10.1145/3192366.3192381openalex-snapshot
Certified concurrent abstraction layers
inferredcites →https://doi.org/10.1145/3264738.3264739openalex-snapshot
HELIX: a case study of a formal verification of high performance program generation
inferredcites →https://doi.org/10.1145/3276495openalex-snapshot
Reconciling high-level optimizations and low-level code in LLVM
inferredcites →https://doi.org/10.1145/3290375openalex-snapshot
An abstract stack based approach to verified compositional compilation to machine code
inferredcites →https://doi.org/10.1145/3290380openalex-snapshot
Exploring C semantics and pointer provenance
inferredcites →https://doi.org/10.1145/3293880.3294106openalex-snapshot
From C to interaction trees: specifying, verifying, and testing a networked server
inferredcites →https://doi.org/10.1145/3341689openalex-snapshot
The next 700 compiler correctness theorems (functional pearl)
inferredcites →https://doi.org/10.1145/3341707openalex-snapshot
A predicate transformer semantics for effects (functional pearl)
inferredcites →https://doi.org/10.1145/3371072openalex-snapshot
The next 700 relational program logics
inferredcites →https://doi.org/10.1145/3371075openalex-snapshot
Formal verification of a constant-time preserving C compiler
inferredcites →https://doi.org/10.1145/3371091openalex-snapshot
CompCertM: CompCert with C-assembly linking and lightweight modular verification
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/3372885.3373813openalex-snapshot
An equational theory for weak bisimulation via generalized parameterized coinduction
inferredcites →https://doi.org/10.1145/3453483.3454030openalex-snapshot
Alive2: bounded translation validation for LLVM
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.1145/982962.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.1561/9781680835953openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.7openalex-snapshot
K-LLVM: A Relatively Complete Semantics of LLVM IR
inferredcites →https://doi.org/10.5555/3026877.3026928openalex-snapshot
CertiKOS: an extensible architecture for building certified concurrent OS kernels
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_2openalex-snapshot
Verified Transformation of Continuation-Passing Style into Static Single Assignment Form
inferred← citeshttps://doi.org/10.1007/978-3-031-38828-6_1openalex-snapshot
BIRD: A Binary Intermediate Representation for Formally Verified Decompilation of X86-64 Binaries
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3_15openalex-snapshot
First Steps towards Deductive Verification of LLVM IR
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_12openalex-snapshot
Context-Dependent Effects in Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-93706-4_6openalex-snapshot
Vellvm: Formalizing the Informal LLVM
inferred← citeshttps://doi.org/10.1017/s0956796825100105openalex-snapshot
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
inferred← citeshttps://doi.org/10.1109/ispds58840.2023.10235678openalex-snapshot
Optimization of Access Address Calculation for LLVM
inferred← citeshttps://doi.org/10.1109/ubmk63289.2024.10773478openalex-snapshot
Optimizing LLVM IR: Transforming Multiplication to Addition for Enhanced Execution Efficiency
inferred← citeshttps://doi.org/10.1145/3547630openalex-snapshot
Formal reasoning about layered monadic interpreters
inferred← citeshttps://doi.org/10.1145/3563355openalex-snapshot
Intrinsically-typed definitional interpreters à la carte
inferred← citeshttps://doi.org/10.1145/3571202openalex-snapshot
Formally Verified Native Code Generation in an Effectful JIT: Turning the CompCert Backend into a Formally Verified JIT Compiler
inferred← citeshttps://doi.org/10.1145/3571254openalex-snapshot
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
inferred← citeshttps://doi.org/10.1145/3623476openalex-snapshot
Proceedings of the 16th ACM SIGPLAN International Conference on Software Language Engineering
inferred← citeshttps://doi.org/10.1145/3623476.3623529openalex-snapshot
An Executable Semantics for Faster Development of Optimizing Python Compilers
inferred← citeshttps://doi.org/10.1145/3632854openalex-snapshot
Modular Denotational Semantics for Effects with Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3674652openalex-snapshot
A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer–Pointer Casts, Finite Space, and undef at the LLVM IR Level of Abstraction
inferred← citeshttps://doi.org/10.1145/3676641.3716270openalex-snapshot
Ratte: Fuzzing for Miscompilations in Multi-Level Compilers Using Composable Semantics
inferred← citeshttps://doi.org/10.1145/3703595.3705890openalex-snapshot
Monadic Interpreters for Concurrent Memory Models
inferred← citeshttps://doi.org/10.1145/3705593openalex-snapshot
Formal Verification of Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705596openalex-snapshot
Background on Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705597openalex-snapshot
Background on the CompCert Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705598openalex-snapshot
Designing Formally Verified JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705599openalex-snapshot
Formally Verified Speculative Optimizations
inferred← citeshttps://doi.org/10.1145/3705593.3705600openalex-snapshot
Formal Verification of Impure Coq JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705601openalex-snapshot
Formal Verification of a JIT Backend Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705604openalex-snapshot
Relating the Developments to the Book
inferred← citeshttps://doi.org/10.1145/3729260openalex-snapshot
Exploiting Undefined Behavior in C/C++ Programs for Optimization: A Study on the Performance Impact
inferred← citeshttps://doi.org/10.1145/3747509openalex-snapshot
Formal Semantics and Program Logics for a Fragment of OCaml
inferred← citeshttps://doi.org/10.1145/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3759425.3763391openalex-snapshot
A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants
inferred← citeshttps://doi.org/10.1145/3763091openalex-snapshot
Structural Temporal Logic for Mechanized Program Verification
inferred← citeshttps://doi.org/10.1145/3776714openalex-snapshot
A Family of Sims with Diverging Interests
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.1145/3808250openalex-snapshot
Towards Removing Undef Values from LLVM IR
inferred← citeshttps://doi.org/10.23919/date64628.2025.10993257openalex-snapshot
Accurate and Extensible Symbolic Execution of Binary Code Based on Formal ISA Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.394.10openalex-snapshot
Q# as a Quantum Algorithmic Language
inferred← citeshttps://doi.org/10.70675/bfb1bf73z45cez4651z9900z881984e8c420openalex-snapshot
Formal Verification of Just-in-Time Compilation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.