On the public citation graph

Formal Verification of an SSA-Based Middle-End for CompCert

https://doi.org/10.1145/2579080
0 signed · 75 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-024x(199706)27:6<701::aid-spe104>3.3.co;2-sopenalex-snapshot
Value Numbering
inferredcites →https://doi.org/10.1002/(sici)1097-024x(19980710)28:8<859::aid-spe188>3.0.co;2-8openalex-snapshot
Practical improvements to the construction and destruction of static single assignment form
inferredcites →https://doi.org/10.1007/11688839_20openalex-snapshot
Register Allocation for Programs in SSA-Form
inferredcites →https://doi.org/10.1007/3-540-46423-9_8openalex-snapshot
Simple Generation of Static Single-Assignment Form
inferredcites →https://doi.org/10.1007/3-540-48294-6_13openalex-snapshot
Translating Out of Static Single Assignment Form
inferredcites →https://doi.org/10.1007/978-3-540-75560-9_17openalex-snapshot
Mechanized Verification of CPS Transformations
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_26openalex-snapshot
A Framework for Formal Verification of Compiler Optimizations
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_59openalex-snapshot
Equality-Based Translation Validator for LLVM
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_3openalex-snapshot
A Formally Verified SSA-Based Middle-End
inferredcites →https://doi.org/10.1007/978-3-642-35308-6_6openalex-snapshot
Mechanized Verification of Computing Dominators for Formalizing Compilers
inferredcites →https://doi.org/10.1007/bfb0026423openalex-snapshot
Basic-block graphs: Living dinosaurs?
inferredcites →https://doi.org/10.1007/bfb0054170openalex-snapshot
Translation validation
inferredcites →https://doi.org/10.1007/s10817-007-9096-8openalex-snapshot
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1016/j.entcs.2005.02.042openalex-snapshot
Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL
inferredcites →https://doi.org/10.1017/cbo9781139174930openalex-snapshot
Modern Compiler Implementation in C
inferredcites →https://doi.org/10.1109/cgo.2009.19openalex-snapshot
Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency
inferredcites →https://doi.org/10.1145/1111037.1111072openalex-snapshot
A verifiable SSA program representation for aggressive compiler optimization
inferredcites →https://doi.org/10.1145/1140335.1140365openalex-snapshot
A type system equivalent to static single assignment
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/1356058.1356064openalex-snapshot
Fast liveness checking for ssa-form programs
inferredcites →https://doi.org/10.1145/1411203.1411226openalex-snapshot
Parametric higher-order abstract syntax for mechanized semantics
inferredcites →https://doi.org/10.1145/1411204.1411226openalex-snapshot
Parametric higher-order abstract syntax for mechanized semantics
inferredcites →https://doi.org/10.1145/143095.143136openalex-snapshot
Lazy code motion
inferredcites →https://doi.org/10.1145/1480881.1480915openalex-snapshot
Equality saturation
inferredcites →https://doi.org/10.1145/1542476.1542512openalex-snapshot
Verified validation of lazy code motion
inferredcites →https://doi.org/10.1145/1706299.1706311openalex-snapshot
A simple, verified validator for software pipelining
inferredcites →https://doi.org/10.1145/1706299.1706312openalex-snapshot
A verified compiler for an impure functional language
inferredcites →https://doi.org/10.1145/197320.197331openalex-snapshot
Single-pass generation of static single-assignment form for structured languages
inferredcites →https://doi.org/10.1145/1993316.1993533openalex-snapshot
Evaluating value-graph translation validation for LLVM
inferredcites →https://doi.org/10.1145/1993498.1993533openalex-snapshot
Evaluating value-graph translation validation for LLVM
inferredcites →https://doi.org/10.1145/2103621.2103709openalex-snapshot
Formalizing the LLVM intermediate representation for verified program transformations
inferredcites →https://doi.org/10.1145/2103656.2103709openalex-snapshot
Formalizing the LLVM intermediate representation for verified program transformations
inferredcites →https://doi.org/10.1145/2491956.2462164openalex-snapshot
Formal verification of SSA-based optimizations for LLVM
inferredcites →https://doi.org/10.1145/258915.258940openalex-snapshot
A new algorithm for partial redundancy elimination based on SSA form
inferredcites →https://doi.org/10.1145/278283.278285openalex-snapshot
SSA is functional programming
inferredcites →https://doi.org/10.1145/349299.349314openalex-snapshot
Translation validation for an optimizing compiler
inferredcites →https://doi.org/10.1145/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.1145/73560.73561openalex-snapshot
Detecting equality of variables in programs

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-030-51054-1_19openalex-snapshot
A Fast Verified Liveness Analysis in SSA Form
inferred← citeshttps://doi.org/10.1007/978-3-030-65277-7_6openalex-snapshot
Certified Compilation for Cryptography: Extended x86 Instructions and Constant-Time Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_7openalex-snapshot
A Self-certifying Compilation Framework for WebAssembly
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_33openalex-snapshot
Formally Validating a Practical Verification Condition Generator
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-76554-4_8openalex-snapshot
Modeling Register Pairs in CompCert
inferred← citeshttps://doi.org/10.1007/978-3-032-40374-2_19openalex-snapshot
GPU-Accelerated Host-Aware Dead-Measurement Detection in Hybrid Quantum–Classical Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_6openalex-snapshot
Validating Dominator Trees for a Fast, Verified Dominance Test
inferred← citeshttps://doi.org/10.1007/978-3-319-72344-0_3openalex-snapshot
Formal Verification of Optimizing Compilers
inferred← citeshttps://doi.org/10.1007/978-3-662-46663-6_12openalex-snapshot
Verifying Fast and Sparse SSA-Based Optimizations in Coq
inferred← citeshttps://doi.org/10.1017/s0956796818000229openalex-snapshot
The verified CakeML compiler backend
inferred← citeshttps://doi.org/10.1145/2892208.2892211openalex-snapshot
Verified construction of static single assignment form
inferred← citeshttps://doi.org/10.1145/2892208.2892222openalex-snapshot
Mechanizing conventional SSA for a verified destruction with coalescing
inferred← citeshttps://doi.org/10.1145/2951913.2951924openalex-snapshot
A new verified compiler backend for CakeML
inferred← citeshttps://doi.org/10.1145/2955811.2955813openalex-snapshot
A formal account of SSA in Java-like languages
inferred← citeshttps://doi.org/10.1145/3022670.2951924openalex-snapshot
A new verified compiler backend for CakeML
inferred← citeshttps://doi.org/10.1145/3062341.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferred← citeshttps://doi.org/10.1145/3140587.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferred← citeshttps://doi.org/10.1145/3178372.3179503openalex-snapshot
Semantic reasoning about the sea of nodes
inferred← citeshttps://doi.org/10.1145/3192366.3192377openalex-snapshot
Crellvm: verified credible compilation for LLVM
inferred← citeshttps://doi.org/10.1145/3296979.3192377openalex-snapshot
Crellvm: verified credible compilation for LLVM
inferred← citeshttps://doi.org/10.1145/3453483.3454030openalex-snapshot
Alive2: bounded translation validation for LLVM
inferred← citeshttps://doi.org/10.1145/3461648.3463850openalex-snapshot
Simple, light, yet formally verified, global common subexpression elimination and loop-invariant code motion
inferred← citeshttps://doi.org/10.1145/3529507openalex-snapshot
Formally Verified Loop-Invariant Code Motion and Assorted Optimizations
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/3571258openalex-snapshot
SSA Translation Is an Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3573105.3575681openalex-snapshot
Mechanised Semantics for Gated Static Single Assignment
inferred← citeshttps://doi.org/10.1145/3591254openalex-snapshot
Synthesizing Quantum-Circuit Optimizers
inferred← citeshttps://doi.org/10.1145/3597926.3598038openalex-snapshot
Pattern-Based Peephole Optimizations with Java JIT Tests
inferred← citeshttps://doi.org/10.1145/3656455openalex-snapshot
Hyperblock Scheduling for Verified High-Level Synthesis
inferred← citeshttps://doi.org/10.1145/3674629openalex-snapshot
A Safe Low-Level Language for Computer Algebra and Its Formally Verified Compiler
inferred← citeshttps://doi.org/10.1145/3704881openalex-snapshot
Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer Casting
inferred← citeshttps://doi.org/10.3929/ethz-b-000489720openalex-snapshot
Formally Validating a Practical Verification Condition Generator (extended version)
inferred← citeshttps://doi.org/10.70675/016d77dezc74fz44a7z9a73z954d6ecfd363openalex-snapshot
Secure compilation for memory protection
inferred← citeshttps://doi.org/10.70675/4ca8962fz96b1z4291zbc7bz64918999dbe3openalex-snapshot
Optimized and formally-verified compilation for a VLIW processor
inferred← citeshttps://doi.org/10.70675/f9ce3bffz5f3cz4aa5zacbdzdfa890f1713bopenalex-snapshot
Vers la compilation vérifiée de Sea of Nodes : propriétés et raisonnement sémantiques
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.