On the public citation graph

Program sketching with live bidirectional evaluation

0 signed · 62 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-21668-3_13openalex-snapshot
Deductive Program Repair
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_3openalex-snapshot
The Sketching Approach to Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_13openalex-snapshot
Abstract Refinement Types
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_67openalex-snapshot
Recursive Program Synthesis
inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot
Syntax-guided synthesis
inferredcites →https://doi.org/10.1109/live.2013.6617346openalex-snapshot
A perspective on the evolution of live programming
inferredcites →https://doi.org/10.1145/1065010.1065045openalex-snapshot
Programming by sketching for bit-streaming programs
inferredcites →https://doi.org/10.1145/1352582.1352591openalex-snapshot
Contextual modal type theory
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/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/3062341.3062351openalex-snapshot
Component-based synthesis of table consolidation and transformation tasks from examples
inferredcites →https://doi.org/10.1145/3180155.3180200openalex-snapshot
The road to live programming
inferredcites →https://doi.org/10.1145/3242587.3242661openalex-snapshot
Rousillon
inferredcites →https://doi.org/10.1145/3276497openalex-snapshot
Bidirectional evaluation with direct manipulation
inferredcites →https://doi.org/10.1145/3276519openalex-snapshot
Finding code that explodes under symbolic evaluation
inferredcites →https://doi.org/10.1145/3341699openalex-snapshot
Synthesizing symmetric lenses
inferredcites →https://doi.org/10.1145/3371080openalex-snapshot
Program synthesis by type-guided abstraction refinement
inferredcites →https://doi.org/10.1145/3371117openalex-snapshot
Visualization by example
inferredcites →https://doi.org/10.1561/2500000010openalex-snapshot
Program Synthesis

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-93409-5_54openalex-snapshot
Neural-Guided, Bidirectional Program Search for Abstraction and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_2openalex-snapshot
Program Synthesis Using Example Propagation
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_4openalex-snapshot
Program Synthesis from Graded Types
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_3openalex-snapshot
Relational Synthesis of Recursive Programs via Constraint Annotated Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-99751-8_15openalex-snapshot
Synthesizing Accumulative Functions Via Program Transformation
inferred← citeshttps://doi.org/10.1007/s10703-023-00436-9openalex-snapshot
Synbit: synthesizing bidirectional programs using unidirectional sketches
inferred← citeshttps://doi.org/10.1017/s0956796825100063openalex-snapshot
Inductive synthesis of structurally recursive functional programs from non-recursive expressions
inferred← citeshttps://doi.org/10.1109/access.2025.3577238openalex-snapshot
Synthesizing Recursive Logic Programs by Inverting General Resolution
inferred← citeshttps://doi.org/10.1109/icse-nier55298.2022.9793523openalex-snapshot
Grammars for Free: Toward Grammar Inference for Ad Hoc Parsers
inferred← citeshttps://doi.org/10.1109/vl-hcc65237.2025.00021openalex-snapshot
Debugging into Existence with Program Synthesis
inferred← citeshttps://doi.org/10.1109/vl/hcc53370.2022.9833110openalex-snapshot
An Integrative Human-Centered Architecture for Interactive Programming Assistants
inferred← citeshttps://doi.org/10.1145/3485482openalex-snapshot
Synbit: synthesizing bidirectional programs using unidirectional sketches
inferred← citeshttps://doi.org/10.1145/3485530openalex-snapshot
LooPy: interactive program synthesis with control structures
inferred← citeshttps://doi.org/10.1145/3485532openalex-snapshot
How statically-typed functional programmers write code
inferred← citeshttps://doi.org/10.1145/3498682openalex-snapshot
Bottom-up synthesis of recursive functional programs using angelic execution
inferred← citeshttps://doi.org/10.1145/3510003.3510195openalex-snapshot
Towards bidirectional live programming for incomplete programs
inferred← citeshttps://doi.org/10.1145/3510455.3512787openalex-snapshot
Grammars for free
inferred← citeshttps://doi.org/10.1145/3519939.3523725openalex-snapshot
ANOSY: approximated knowledge synthesis with refinement types for declassification
inferred← citeshttps://doi.org/10.1145/3519939.3523726openalex-snapshot
Recursion synthesis with unrealizability witnesses
inferred← citeshttps://doi.org/10.1145/3526113.3545659openalex-snapshot
Exploring the Learnability of Program Synthesizers by Novice Programmers
inferred← citeshttps://doi.org/10.1145/3527329openalex-snapshot
Language-parametric static semantic code completion
inferred← citeshttps://doi.org/10.1145/3563306openalex-snapshot
Data-driven lemma synthesis for interactive proofs
inferred← citeshttps://doi.org/10.1145/3563768.3565550openalex-snapshot
Grammar Inference for Ad Hoc Parsers
inferred← citeshttps://doi.org/10.1145/3563835.3567658openalex-snapshot
Derivations with Holes for Concept-Based Program Synthesis
inferred← citeshttps://doi.org/10.1145/3571263openalex-snapshot
Inductive Synthesis of Structurally Recursive Functional Programs from Non-recursive Expressions
inferred← citeshttps://doi.org/10.1145/3586048openalex-snapshot
Live Pattern Matching with Typed Holes
inferred← citeshttps://doi.org/10.1145/3591248openalex-snapshot
ImageEye: Batch Image Processing using Program Synthesis
inferred← citeshttps://doi.org/10.1145/3591255openalex-snapshot
Trace-Guided Inductive Synthesis of Recursive Functional Programs
inferred← citeshttps://doi.org/10.1145/3618305.3623595openalex-snapshot
Synthesizing Recursive Programs through Dataflow Constraints
inferred← citeshttps://doi.org/10.1145/3622800openalex-snapshot
Synthesizing Efficient Memoization Algorithms
inferred← citeshttps://doi.org/10.1145/3656381openalex-snapshot
Recursive Program Synthesis using Paramorphisms
inferred← citeshttps://doi.org/10.1145/3656415openalex-snapshot
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/3674636openalex-snapshot
Example-Based Reasoning about the Realizability of Polymorphic Programs
inferred← citeshttps://doi.org/10.1145/3689728openalex-snapshot
Statically Contextualizing Large Language Models with Typed Holes
inferred← citeshttps://doi.org/10.1145/3729264openalex-snapshot
Programming by Navigation
inferred← citeshttps://doi.org/10.1145/3729336openalex-snapshot
A Concurrent Approach to String Transformation Synthesis
inferred← citeshttps://doi.org/10.1145/3744916.3787779openalex-snapshot
Distance-Guided Search in Program Synthesis with Imperfect LLM Solutions
inferred← citeshttps://doi.org/10.1145/3759429.3762619openalex-snapshot
ScooPy: Enhancing Program Synthesis with Nested Example Specifications
inferred← citeshttps://doi.org/10.1145/3772318.3791327openalex-snapshot
Programming By Scaffolded Demonstration with Perpend
inferred← citeshttps://doi.org/10.1145/3779209.3779535openalex-snapshot
Hole Refinements for Polymorphic Type-and-Example Driven Synthesis
inferred← citeshttps://doi.org/10.1145/3814885.3816413openalex-snapshot
Synthesizing Recursive Functional Programs via Structure-Element Separation
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.