On the public citation graph
Compiling symbolic execution with staging and algebraic effects
0 signed · 99 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/3-540-16446-4_11openalex-snapshot
Code generation from two-level denotational meta-languages
inferredcites →https://doi.org/10.1007/3-540-56039-4_38openalex-snapshot
Naturally embedded query languages
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/978-3-319-30936-1_17openalex-snapshot
The Essence of Multi-stage Evaluation in LMS
inferredcites →https://doi.org/10.1007/978-3-319-89719-6_6openalex-snapshot
Concurrent System Programming with Effect Handlers
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.1007/978-3-662-54580-5openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/s10990-013-9096-9openalex-snapshot
Scala-Virtualized: linguistic reuse for deep embeddings
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.1016/bs.adcom.2018.10.002openalex-snapshot
Advances in Symbolic Execution
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.003openalex-snapshot
An Introduction to Algebraic Effects and Handlers. Invited tutorial paper
inferredcites →https://doi.org/10.1016/s0304-3975(00)00053-0openalex-snapshot
MetaML and multi-stage programming with explicit annotations
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/s0956796820000106openalex-snapshot
Generalized monoidal effects and handlers
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.1023/a:1023064908962openalex-snapshot
Algebraic Operations and Generic Effects
inferredcites →https://doi.org/10.1109/ase.2008.69openalex-snapshot
Heuristics for Scalable Dynamic Test Generation
inferredcites →https://doi.org/10.1109/sp.2010.26openalex-snapshot
All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask)
inferredcites →https://doi.org/10.1109/tse.1977.231144openalex-snapshot
Symbolic Testing and the DISSECT Symbolic Evaluation System
inferredcites →https://doi.org/10.1145/1291151.1291178openalex-snapshot
Adding delimited and composable control to a production programming environment
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/1449913.1449935openalex-snapshot
Polymorphic embedding of dsls
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/1596550.1596596openalex-snapshot
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
inferredcites →https://doi.org/10.1145/174675.178068openalex-snapshot
Building interpreters by composing monads
inferredcites →https://doi.org/10.1145/202530.202534openalex-snapshot
A simple graph-based intermediate representation
inferredcites →https://doi.org/10.1145/2408776.2408795openalex-snapshot
Symbolic execution for software testing
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/2541940.2541977openalex-snapshot
Prototyping symbolic execution engines for interpreted languages
inferredcites →https://doi.org/10.1145/258993.259019openalex-snapshot
Multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1145/2594291.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
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/3009837.3009867openalex-snapshot
LMS-Verify: abstraction without regret for verified systems programming
inferredcites →https://doi.org/10.1145/3110252openalex-snapshot
A unified approach to solving seven programming problems (functional pearl)
inferredcites →https://doi.org/10.1145/3110256openalex-snapshot
Abstracting definitional interpreters (functional pearl)
inferredcites →https://doi.org/10.1145/3110260openalex-snapshot
Persistence for the masses: RRB-vectors in a systems language
inferredcites →https://doi.org/10.1145/3136040.3136060openalex-snapshot
Staging for generic programming in space and time
inferredcites →https://doi.org/10.1145/3158139openalex-snapshot
Soft contract verification for higher-order stateful programs
inferredcites →https://doi.org/10.1145/3170492.3136060openalex-snapshot
Staging for generic programming in space and time
inferredcites →https://doi.org/10.1145/3182657openalex-snapshot
A Survey of Symbolic Execution Techniques
inferredcites →https://doi.org/10.1145/3183713.3196893openalex-snapshot
How to Architect a Query Compiler, Revisited
inferredcites →https://doi.org/10.1145/319838openalex-snapshot
Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86
inferredcites →https://doi.org/10.1145/3236762openalex-snapshot
Versatile event correlation with algebraic effects
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/3278122.3278139openalex-snapshot
A practical unification of multi-stage programming and macros
inferredcites →https://doi.org/10.1145/328690openalex-snapshot
Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
inferredcites →https://doi.org/10.1145/3315507.3330200openalex-snapshot
Towards compiling graph queries in relational engines
inferredcites →https://doi.org/10.1145/3318464.3389701openalex-snapshot
Architecting a Query Compiler for Spatial Workloads
inferredcites →https://doi.org/10.1145/3341301.3359641openalex-snapshot
Scaling symbolic evaluation for automated verification of systems code with Serval
inferredcites →https://doi.org/10.1145/3357765.3359514openalex-snapshot
A stage-polymorphic IR for compiling MATLAB-style dynamic tensor expressions
inferredcites →https://doi.org/10.1145/3358502.3361269openalex-snapshot
From definitional interpreter to symbolic executor
inferredcites →https://doi.org/10.1145/3360552openalex-snapshot
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming
inferredcites →https://doi.org/10.1145/3360563openalex-snapshot
BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation
inferredcites →https://doi.org/10.1145/390016.808445openalex-snapshot
SELECT—a formal system for testing and debugging programs by symbolic execution
inferredcites →https://doi.org/10.1145/636517.636528openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/73560.73576openalex-snapshot
The theory and practice of first-class prompts
inferredcites →https://doi.org/10.1145/800027.808445openalex-snapshot
SELECT---a formal system for testing and debugging programs by symbolic execution
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
inferredcites →https://doi.org/10.1561/9781680834376openalex-snapshot
Reconciling Abstraction with High Performance: A MetaOCaml approach
inferredcites →https://doi.org/10.4230/dagrep.8.4.104openalex-snapshot
Algebraic Effect Handlers go Mainstream (Dagstuhl Seminar 18172)
inferredcites →https://doi.org/10.4230/lipics.fscd.2017.18openalex-snapshot
Continuation Passing Style for Effect Handlers
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.238openalex-snapshot
Go Meta! A Case for Generative Programming and DSLs in Performance Critical Systems
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-89051-3_11openalex-snapshot
Latent Effects for Reusable Language Components
inferred← citeshttps://doi.org/10.1108/ftpgl-11-2025-0068openalex-snapshot
Neurosymbolic code auditing
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00116openalex-snapshot
Compiling Parallel Symbolic Execution with Continuations
inferred← citeshttps://doi.org/10.1145/3468264.3473108openalex-snapshot
LLSC: a parallel symbolic execution compiler for LLVM IR
inferred← citeshttps://doi.org/10.1145/3473580openalex-snapshot
Contextual modal types for algebraic effects and handlers
inferred← citeshttps://doi.org/10.1145/3571209openalex-snapshot
Grisette: Symbolic Compilation as a Functional Programming Library
inferred← citeshttps://doi.org/10.1145/3622813openalex-snapshot
Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies
inferred← citeshttps://doi.org/10.1145/3632928openalex-snapshot
Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
inferred← citeshttps://doi.org/10.1145/3704253openalex-snapshot
Proceedings of the 2025 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation
inferred← citeshttps://doi.org/10.1145/3704253.3706138openalex-snapshot
Typed Program Analysis without Encodings
inferred← citeshttps://doi.org/10.1145/3828676openalex-snapshot
Let It Be Optimized: Building Multi-stage Evaluators with Let-Insertion and Optimizations in Small Pieces (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3839498openalex-snapshot
Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots
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.