On the public citation graph
Compositional optimizations for CertiCoq
0 signed · 79 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/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
inferredcites →https://doi.org/10.1007/3-540-61055-3openalex-snapshot
Programming Languages and Systems — ESOP '96
inferredcites →https://doi.org/10.1007/3-540-61055-3_27openalex-snapshot
Compiling Haskell by program transformation: A report from the trenches
inferredcites →https://doi.org/10.1007/978-1-4471-3236-3openalex-snapshot
Functional Programming, Glasgow 1993
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_8openalex-snapshot
Verifying an Open Compiler Using Multi-language Semantics
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_23openalex-snapshot
Functional Big-Step Semantics
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/j.entcs.2016.06.013openalex-snapshot
Proving Correctness of a Compiler Using Step-indexed Logical Relations
inferredcites →https://doi.org/10.1016/j.ic.2007.12.004openalex-snapshot
Coinductive big-step operational semantics
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s0956796818000229openalex-snapshot
The verified CakeML compiler backend
inferredcites →https://doi.org/10.1017/s0956796897002839openalex-snapshot
Shrinking lambda expressions in linear time
inferredcites →https://doi.org/10.1145/114005.102805openalex-snapshot
Compilation of functional languages by program transformation
inferredcites →https://doi.org/10.1145/1190216.1190220openalex-snapshot
Operational semantics for multi-language programs
inferredcites →https://doi.org/10.1145/12276.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/1291151.1291179openalex-snapshot
Compiling with continuations, continued
inferredcites →https://doi.org/10.1145/1291220.1291179openalex-snapshot
Compiling with continuations, continued
inferredcites →https://doi.org/10.1145/1328438.1328476openalex-snapshot
Imperative self-adjusting computation
inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/1631687.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
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/182409.156783openalex-snapshot
Space-efficient closure representations
inferredcites →https://doi.org/10.1145/1925844.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/1926385.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/1993316.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferredcites →https://doi.org/10.1145/2103656.2103666openalex-snapshot
The marriage of bisimulations and Kripke logical relations
inferredcites →https://doi.org/10.1145/2364527.2364531openalex-snapshot
Verified heap theorem prover by paramodulation
inferredcites →https://doi.org/10.1145/2676724.2693167openalex-snapshot
A Compositional Semantics for Verified Separate Compilation and Linking
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2701415openalex-snapshot
Verification of a Cryptographic Primitive
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/2858949.2784764openalex-snapshot
Pilsner: a compositionally verified compiler for a higher-order imperative language
inferredcites →https://doi.org/10.1145/2914770.2837642openalex-snapshot
Lightweight verification of separate compilation
inferredcites →https://doi.org/10.1145/2951913.2951924openalex-snapshot
A new verified compiler backend for CakeML
inferredcites →https://doi.org/10.1145/3062341.3062380openalex-snapshot
Compiling without continuations
inferredcites →https://doi.org/10.1145/3110262openalex-snapshot
Verifying efficient function calls in CakeML
inferredcites →https://doi.org/10.1145/3158152openalex-snapshot
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
inferredcites →https://doi.org/10.1145/3167089openalex-snapshot
Œuf: minimizing the Coq extraction TCB
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/3341689openalex-snapshot
The next 700 compiler correctness theorems (functional pearl)
inferredcites →https://doi.org/10.1145/3371075openalex-snapshot
Formal verification of a constant-time preserving C compiler
inferredcites →https://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferredcites →https://doi.org/10.1145/3371091openalex-snapshot
CompCertM: CompCert with C-assembly linking and lightweight modular verification
inferredcites →https://doi.org/10.1145/3434287openalex-snapshot
Efficient and provable local capability revocation using uninitialized capabilities
inferredcites →https://doi.org/10.1145/345099.345125openalex-snapshot
Efficient and safe-for-space closure conversion
inferredcites →https://doi.org/10.1145/3485491openalex-snapshot
Compiling with continuations, correctly
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.1145/75277.75302openalex-snapshot
Realistic compilation by program transformation (detailed summary)
inferredcites →https://doi.org/10.1145/800068.802129openalex-snapshot
Super-combinators a new implementation method for applicative languages
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-99336-8_8openalex-snapshot
The Trusted Computing Base of the CompCert Verified Compiler
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-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_11openalex-snapshot
Verified Inlining and Specialisation for PureCake
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100793openalex-snapshot
Formal analysis of the application programming interface of the PVS verification system
inferred← citeshttps://doi.org/10.1017/s0956796822000077openalex-snapshot
Extracting functional programs from Coq, in Coq
inferred← citeshttps://doi.org/10.1109/access.2023.3260182openalex-snapshot
IoT Capabilities Composition and Decomposition: A Systematic Review
inferred← citeshttps://doi.org/10.1145/3519939.3523706openalex-snapshot
Relational compilation for performance-critical applications: extensible proof-producing translation of functional models into low-level code
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3656390openalex-snapshot
A Verified Compiler for a Functional Tensor Language
inferred← citeshttps://doi.org/10.1145/3703595.3705879openalex-snapshot
CertiCoq-Wasm: A Verified WebAssembly Backend for CertiCoq
inferred← citeshttps://doi.org/10.1145/3704860openalex-snapshot
A Verified Foreign Function Interface between Coq and C
inferred← citeshttps://doi.org/10.1145/3729280openalex-snapshot
Webs and Flow-Directed Well-Typedness Preserving Program Transformations
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.3390/math10203800openalex-snapshot
On Coevaluation Behavior and Equivalence
inferred← citeshttps://doi.org/10.70675/a56b1bcez2a44z4e4az8e69zeec71287c91copenalex-snapshot
Toward a Framework for the Composition and Assessment of IoT and CPS Capabilities : Smart Cities Applications
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.