On the public citation graph

A formal foundation for symbolic evaluation with merging

https://doi.org/10.1145/3498709
0 signed · 53 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.1007/978-3-319-21401-6_26openalex-snapshot
The Lean Theorem Prover (System Description)
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_2openalex-snapshot
Investigating Safety of a Radiotherapy Machine Using System Models with Pluggable Checkers
inferredcites →https://doi.org/10.1007/978-3-319-63046-5_14openalex-snapshot
Efficient Certified RAT Verification
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_13openalex-snapshot
Refinement Types for Ruby
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_15openalex-snapshot
A Tool for Checking ANSI-C Programs
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_14openalex-snapshot
CVC4
inferredcites →https://doi.org/10.1016/j.jsc.2016.07.012openalex-snapshot
A generic framework for symbolic execution: A coinductive approach
inferredcites →https://doi.org/10.1017/s0956796816000216openalex-snapshot
Higher order symbolic execution for contract verification and refutation
inferredcites →https://doi.org/10.1017/s0956796817000107openalex-snapshot
Fair enumeration combinators
inferredcites →https://doi.org/10.1109/tse.1976.233817openalex-snapshot
A System to Generate Test Data and Symbolically Execute Programs
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1706299.1706312openalex-snapshot
A verified compiler for an impure functional language
inferredcites →https://doi.org/10.1145/1706299.1706339openalex-snapshot
Programming with angelic nondeterminism
inferredcites →https://doi.org/10.1145/173262.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/2509578.2509586openalex-snapshot
Growing solver-aided languages with rosette
inferredcites →https://doi.org/10.1145/2666356.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2676726.2676966openalex-snapshot
A Formally-Verified C Static Analyzer
inferredcites →https://doi.org/10.1145/2714064.2660208openalex-snapshot
Smten with satisfiability-based search
inferredcites →https://doi.org/10.1145/2786805.2786830openalex-snapshot
MultiSE: multi-path symbolic execution using value summaries
inferredcites →https://doi.org/10.1145/2872362.2872387openalex-snapshot
Scaling up Superoptimization
inferredcites →https://doi.org/10.1145/2872362.2872406openalex-snapshot
Specifying and Checking File System Crash-Consistency Models
inferredcites →https://doi.org/10.1145/2892664.2892667openalex-snapshot
Wallingford: toward a constraint reactive programming language
inferredcites →https://doi.org/10.1145/2983990.2984012openalex-snapshot
Scalable verification of border gateway protocol configurations with an SMT solver
inferredcites →https://doi.org/10.1145/3102071.3102084openalex-snapshot
Synthesizing interpretable strategies for solving puzzle games
inferredcites →https://doi.org/10.1145/3110269openalex-snapshot
SpaceSearch: a library for building and verifying solver-aided tools
inferredcites →https://doi.org/10.1145/3127323openalex-snapshot
A programmable programming language
inferredcites →https://doi.org/10.1145/3140587.3062353openalex-snapshot
Synthesizing memory models from framework sketches and Litmus tests
inferredcites →https://doi.org/10.1145/3158150openalex-snapshot
Bonsai: synthesis-based reasoning for type systems
inferredcites →https://doi.org/10.1145/3276519openalex-snapshot
Finding code that explodes under symbolic evaluation
inferredcites →https://doi.org/10.1145/3297858.3304027openalex-snapshot
Puddle
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/3385412.3385985openalex-snapshot
Validating SMT solvers via semantic fusion
inferredcites →https://doi.org/10.1145/3385412.3386014openalex-snapshot
Gillian, part i: a multi-language platform for symbolic execution
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/775832.775928openalex-snapshot
Behavioral consistency of C and verilog programs using bounded model checking
inferredcites →https://doi.org/10.24963/ijcai.2017/667openalex-snapshot
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
inferredcites →https://doi.org/10.3233/sat190101openalex-snapshot
Boolector 2.0

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-47963-2_22openalex-snapshot
Denotational Semantics for Symbolic Execution
inferred← citeshttps://doi.org/10.1007/978-3-031-76554-4_13openalex-snapshot
Correct and Complete Symbolic Execution for Free
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115263openalex-snapshot
Compositional symbolic execution semantics
inferred← citeshttps://doi.org/10.1108/ftpgl-11-2025-0068openalex-snapshot
Neurosymbolic code auditing
inferred← citeshttps://doi.org/10.1145/3519939.3523732openalex-snapshot
Karp: a language for NP reductions
inferred← citeshttps://doi.org/10.1145/3571209openalex-snapshot
Grisette: Symbolic Compilation as a Functional Programming Library
inferred← citeshttps://doi.org/10.1145/3620665.3640387openalex-snapshot
FPGA Technology Mapping Using Sketch-Guided Program Synthesis
inferred← citeshttps://doi.org/10.1145/3622837openalex-snapshot
A Pretty Expressive Printer
inferred← citeshttps://doi.org/10.1145/3649835openalex-snapshot
Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization
inferred← citeshttps://doi.org/10.1145/3656415openalex-snapshot
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
inferred← citeshttps://doi.org/10.1145/3729303openalex-snapshot
Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search
inferred← citeshttps://doi.org/10.1145/3729334openalex-snapshot
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3808343openalex-snapshot
Categorical Semantics of Probabilistic Symbolic Execution
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.