On the public citation graph

Grisette: Symbolic Compilation as a Functional Programming Library

https://doi.org/10.1145/3571209
0 signed · 67 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.1006/inco.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1007/978-3-319-19797-5_15openalex-snapshot
Fusion for Free
inferredcites →https://doi.org/10.1007/978-3-319-30936-1_14openalex-snapshot
The Essence of Dependent Object Types
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-30569-9_3openalex-snapshot
The Spec# Programming System: An Overview
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-00768-2_16openalex-snapshot
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-642-04694-0_6openalex-snapshot
State Joining and Splitting for the Symbolic Execution of Binaries
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_26openalex-snapshot
A Polymorphic Intermediate Verification Language: Design and Logical Encoding
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_45openalex-snapshot
Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries
inferredcites →https://doi.org/10.1007/s100090050043openalex-snapshot
Model checking JAVA programs using JAVA PathFinder
inferredcites →https://doi.org/10.1016/0890-5401(90)90018-dopenalex-snapshot
Type inference for polymorphic references
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1109/cgo.2004.1281665openalex-snapshot
LLVM: a compilation framework for lifelong program analysis & transformation
inferredcites →https://doi.org/10.1109/fmcad.2008.ecp.23openalex-snapshot
Symbolic Program Analysis Using Term Rewriting and Generalization
inferredcites →https://doi.org/10.1145/1040305.1040334openalex-snapshot
Scalable error detection using boolean satisfiability
inferredcites →https://doi.org/10.1145/1065010.1065036openalex-snapshot
DART
inferredcites →https://doi.org/10.1145/1146238.1146251openalex-snapshot
Modular verification of code with SAT
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1190216.1190226openalex-snapshot
Compositional dynamic test generation
inferredcites →https://doi.org/10.1145/1287624.1287653openalex-snapshot
Finding bugs efficiently with a SAT solver
inferredcites →https://doi.org/10.1145/1455518.1455522openalex-snapshot
EXE
inferredcites →https://doi.org/10.1145/1806799.1806833openalex-snapshot
Oracle-guided component-based program synthesis
inferredcites →https://doi.org/10.1145/1995376.1995394openalex-snapshot
Satisfiability modulo theories
inferredcites →https://doi.org/10.1145/2103656.2103675openalex-snapshot
Constraints as control
inferredcites →https://doi.org/10.1145/2254064.2254088openalex-snapshot
Efficient state merging in symbolic execution
inferredcites →https://doi.org/10.1145/2393596.2393667openalex-snapshot
Rubicon
inferredcites →https://doi.org/10.1145/2491411.2491447openalex-snapshot
Jalangi: a selective record-replay and dynamic analysis framework for JavaScript
inferredcites →https://doi.org/10.1145/2500365.2500602openalex-snapshot
The constrained-monad problem
inferredcites →https://doi.org/10.1145/2503778.2503791openalex-snapshot
Extensible effects
inferredcites →https://doi.org/10.1145/2509578.2509586openalex-snapshot
Growing solver-aided languages with rosette
inferredcites →https://doi.org/10.1145/2568225.2568293openalex-snapshot
Enhancing symbolic execution with veritesting
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/2660193.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.2872406openalex-snapshot
Specifying and Checking File System Crash-Consistency Models
inferredcites →https://doi.org/10.1145/2884781.2884807openalex-snapshot
Angelix
inferredcites →https://doi.org/10.1145/3110256openalex-snapshot
Abstracting definitional interpreters (functional pearl)
inferredcites →https://doi.org/10.1145/3110271openalex-snapshot
Compiling to categories
inferredcites →https://doi.org/10.1145/3158150openalex-snapshot
Bonsai: synthesis-based reasoning for type systems
inferredcites →https://doi.org/10.1145/3182657openalex-snapshot
A Survey of Symbolic Execution Techniques
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/3314221.3314618openalex-snapshot
Lazy counterfactual symbolic execution
inferredcites →https://doi.org/10.1145/3331545.3342590openalex-snapshot
G2Q: Haskell constraint solving
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/3358502.3361269openalex-snapshot
From definitional interpreter to symbolic executor
inferredcites →https://doi.org/10.1145/3368089.3409734openalex-snapshot
Java Ranger: statically summarizing regions for efficient symbolic execution of Java
inferredcites →https://doi.org/10.1145/3428232openalex-snapshot
Compiling symbolic execution with staging and algebraic effects
inferredcites →https://doi.org/10.1145/3498709openalex-snapshot
A formal foundation for symbolic evaluation with merging
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/581690.581691openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/800027.808444openalex-snapshot
A new approach to program testing
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/91556.91622openalex-snapshot
Abstracting control
inferredcites →https://doi.org/10.21236/ada606736openalex-snapshot
Multiple-Valued Logic Minimization for PLA Synthesis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1145/3648440openalex-snapshot
Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms
inferred← citeshttps://doi.org/10.1145/3656415openalex-snapshot
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
inferred← citeshttps://doi.org/10.1145/3704865openalex-snapshot
TensorRight: Automated Verification of Tensor Graph Rewrites
inferred← citeshttps://doi.org/10.1145/3725843.3756075openalex-snapshot
TAIDL: Tensor Accelerator ISA Definition Language with Auto-generation of Scalable Test Oracles
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/3763073openalex-snapshot
Synthesizing DSLs for Few-Shot Learning
inferred← citeshttps://doi.org/10.1145/3763162openalex-snapshot
HieraSynth: A Parallel Framework for Complete Super-Optimization with Hierarchical Space Decomposition
inferred← citeshttps://doi.org/10.1145/3793656.3793689openalex-snapshot
TensorEgg: Formally Verifying Rewrite Rules and Applying Them to Tensor Programs
inferred← citeshttps://doi.org/10.1145/3808340openalex-snapshot
Pantomime: Constructive Leakage Proofs via Simulation
inferred← citeshttps://doi.org/10.1145/3815001.3815004openalex-snapshot
Refined Remora: Constraining Array Shapes
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.