On the public citation graph
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming
0 signed · 91 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/11561347_18openalex-snapshot
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
inferredcites →https://doi.org/10.1007/3-540-45937-5_13openalex-snapshot
Modular Static Program Analysis
inferredcites →https://doi.org/10.1007/3-540-61053-7_62openalex-snapshot
Abstract compilation: A new implementation paradigm for static analysis
inferredcites →https://doi.org/10.1007/3-540-61580-6_11openalex-snapshot
What not to do when writing an interpreter for specialisation
inferredcites →https://doi.org/10.1007/978-3-319-06776-6_22openalex-snapshot
Functional Programming in Scala
inferredcites →https://doi.org/10.1007/978-3-319-07151-0_6openalex-snapshot
The Design and Implementation of BER MetaOCaml
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_17openalex-snapshot
The Essence of Multi-stage Evaluation in LMS
inferredcites →https://doi.org/10.1007/978-3-540-39815-8_4openalex-snapshot
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection
inferredcites →https://doi.org/10.1016/0304-3975(86)90006-xopenalex-snapshot
Two-level semantics and code generation
inferredcites →https://doi.org/10.1016/0304-3975(89)90091-1openalex-snapshot
Two-level semantics and abstract interpretation
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1017/cbo9780511526572openalex-snapshot
Two-Level Functional Languages
inferredcites →https://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferredcites →https://doi.org/10.1017/s0956796812000238openalex-snapshot
Systematic abstraction of abstract machines
inferredcites →https://doi.org/10.1023/a:1010095604496openalex-snapshot
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
inferredcites →https://doi.org/10.1109/cgo.2011.5764696openalex-snapshot
Flow-sensitive pointer analysis for millions of lines of code
inferredcites →https://doi.org/10.1145/115865.115884openalex-snapshot
The semantics of Scheme control-flow analysis
inferredcites →https://doi.org/10.1145/1159803.1159807openalex-snapshot
Improving flow analyses via ΓCFA
inferredcites →https://doi.org/10.1145/1159876.1159888openalex-snapshot
Type-sensitive control-flow analysis
inferredcites →https://doi.org/10.1145/1375581.1375616openalex-snapshot
Program analysis as constraint solving
inferredcites →https://doi.org/10.1145/1411204.1411243openalex-snapshot
Deciding k CFA is complete for EXPTIME
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/1863543.1863553openalex-snapshot
Abstracting abstract machines
inferredcites →https://doi.org/10.1145/199448.199528openalex-snapshot
Monad transformers and modular interpreters
inferredcites →https://doi.org/10.1145/2048066.2048105openalex-snapshot
Flow-sensitive type recovery in linear-log time
inferredcites →https://doi.org/10.1145/2187671.2187672openalex-snapshot
Control-flow analysis of functional programs
inferredcites →https://doi.org/10.1145/2426890.2426917openalex-snapshot
Shonan challenge for generative programming
inferredcites →https://doi.org/10.1145/2491956.2491979openalex-snapshot
Monadic abstract interpreters
inferredcites →https://doi.org/10.1145/2500365.2500604openalex-snapshot
Optimizing abstract abstract machines
inferredcites →https://doi.org/10.1145/258993.259019openalex-snapshot
Multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1145/2594291.2594316openalex-snapshot
Surgical precision JIT compilers
inferredcites →https://doi.org/10.1145/2628136.2628153openalex-snapshot
Practical and effective higher-order optimizations
inferredcites →https://doi.org/10.1145/2660193.2660241openalex-snapshot
Staged parser combinators for efficient data processing
inferredcites →https://doi.org/10.1145/2666356.2594316openalex-snapshot
Surgical precision JIT compilers
inferredcites →https://doi.org/10.1145/2784731.2784760openalex-snapshot
Functional pearl: a SQL to C compiler in 500 lines of code
inferredcites →https://doi.org/10.1145/2814270.2814275openalex-snapshot
Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpreters
inferredcites →https://doi.org/10.1145/2814270.2814308openalex-snapshot
Galois transformers and modular abstract interpreters: reusable metatheory for program analysis
inferredcites →https://doi.org/10.1145/2837614.2837631openalex-snapshot
Pushdown control-flow analysis for free
inferredcites →https://doi.org/10.1145/291891.291898openalex-snapshot
A practical and flexible flow analysis for higher-order languages
inferredcites →https://doi.org/10.1145/2951913.2951934openalex-snapshot
Constructive Galois connections: taming the Galois connection framework for mechanized metatheory
inferredcites →https://doi.org/10.1145/2951913.2951936openalex-snapshot
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis
inferredcites →https://doi.org/10.1145/3009837.3009880openalex-snapshot
Stream fusion, to completeness
inferredcites →https://doi.org/10.1145/3009837.3009885openalex-snapshot
Fast polyhedra abstract domain
inferredcites →https://doi.org/10.1145/3110256openalex-snapshot
Abstracting definitional interpreters (functional pearl)
inferredcites →https://doi.org/10.1145/3136040.3136060openalex-snapshot
Staging for generic programming in space and time
inferredcites →https://doi.org/10.1145/3158143openalex-snapshot
A practical construction for decomposing numerical abstract domains
inferredcites →https://doi.org/10.1145/3170492.3136060openalex-snapshot
Staging for generic programming in space and time
inferredcites →https://doi.org/10.1145/3183713.3196893openalex-snapshot
How to Architect a Query Compiler, Revisited
inferredcites →https://doi.org/10.1145/3236767openalex-snapshot
Compositional soundness proofs of abstract interpreters
inferredcites →https://doi.org/10.1145/3236800openalex-snapshot
Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl)
inferredcites →https://doi.org/10.1145/331960.331975openalex-snapshot
DSL implementation using staging and monads
inferredcites →https://doi.org/10.1145/41625.41654openalex-snapshot
A calculus for assignments in higher-order languages
inferredcites →https://doi.org/10.1145/636517.636528openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/888251.888254openalex-snapshot
A functional correspondence between evaluators and abstract machines
inferredcites →https://doi.org/10.1561/2500000038openalex-snapshot
Reconciling Abstraction with High Performance: A MetaOCaml approach
inferredcites →https://doi.org/10.2168/lmcs-7(2:3)2011openalex-snapshot
CFA2: a Context-Free Approach to Control-Flow Analysis
inferredcites →https://doi.org/10.4204/eptcs.129.7openalex-snapshot
Abstract Interpretation as a Programming Language
inferredcites →https://doi.org/10.4230/lipics.snapl.2017.18openalex-snapshot
Taming the Static Analysis Beast
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-99461-7_8openalex-snapshot
Unified Program Generation and Verification: A Case Study on Number-Theoretic Transform
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_5openalex-snapshot
Unconstrained Variable Oracles for Faster Numeric Static Analyses
inferred← citeshttps://doi.org/10.1007/978-3-031-52038-9_5openalex-snapshot
Rhyme: A Data-Centric Expressive Query Language for Nested Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_15openalex-snapshot
Monarch: A Modular Framework for Abstract Definitional Interpreters in Haskell
inferred← citeshttps://doi.org/10.1016/j.future.2026.108479openalex-snapshot
Accl++ : A high-productivity programming language for performance and code portability on heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103035openalex-snapshot
Program generation meets program verification: A case study on number-theoretic transform
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370333openalex-snapshot
BuildIt: A Type-Based Multi-stage Programming Framework for Code Generation in C++
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741280openalex-snapshot
GraphIt to CUDA Compiler in 2021 LOC: A Case for High-Performance DSL Implementation via Staging with BuilDSL
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00116openalex-snapshot
Compiling Parallel Symbolic Execution with Continuations
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00129openalex-snapshot
eCC++ : A Compiler Construction Framework for Embedded Domain-Specific Languages
inferred← citeshttps://doi.org/10.1145/3428232openalex-snapshot
Compiling symbolic execution with staging and algebraic effects
inferred← citeshttps://doi.org/10.1145/3460120.3484795openalex-snapshot
Zero Knowledge Static Program Analysis
inferred← citeshttps://doi.org/10.1145/3464457openalex-snapshot
A Survey of Parametric Static Analysis
inferred← citeshttps://doi.org/10.1145/3607863openalex-snapshot
Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters
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.3623512openalex-snapshot
Cross-Level Debugging for Static Analysers
inferred← citeshttps://doi.org/10.1145/3632928openalex-snapshot
Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
inferred← citeshttps://doi.org/10.1145/3747539openalex-snapshot
Call-Guarded Abstract Definitional Interpreters
inferred← citeshttps://doi.org/10.1145/3839498openalex-snapshot
Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots
inferred← citeshttps://doi.org/10.7717/peerj-cs.3390openalex-snapshot
Faster numeric static analyses with unconstrained variable oracles
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.