On the public citation graph
Bottom-up synthesis of recursive functional programs using angelic execution
0 signed · 72 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-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_10openalex-snapshot
Synthesis Through Unification
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_67openalex-snapshot
Recursive Program Synthesis
inferredcites →https://doi.org/10.1145/1925844.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/1926385.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/2509136.2509555openalex-snapshot
Synthesis modulo recursive functions
inferredcites →https://doi.org/10.1145/2737924.2737952openalex-snapshot
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
inferredcites →https://doi.org/10.1145/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2737924.2738007openalex-snapshot
Type-and-example-directed program synthesis
inferredcites →https://doi.org/10.1145/2786805.2786811openalex-snapshot
Staged program repair with condition synthesis
inferredcites →https://doi.org/10.1145/2813885.2737952openalex-snapshot
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
inferredcites →https://doi.org/10.1145/2813885.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2814270.2814310openalex-snapshot
FlashMeta: a framework for inductive program synthesis
inferredcites →https://doi.org/10.1145/2837614.2837629openalex-snapshot
Example-directed synthesis: a type-theoretic interpretation
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/2914770.2837629openalex-snapshot
Example-directed synthesis: a type-theoretic interpretation
inferredcites →https://doi.org/10.1145/3133886openalex-snapshot
Synthesis of data completion scripts using finite tree automata
inferredcites →https://doi.org/10.1145/3158151openalex-snapshot
Program synthesis using abstraction refinement
inferredcites →https://doi.org/10.1145/321992.322002openalex-snapshot
A Methodology for LISP Program Construction from Examples
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/3290386openalex-snapshot
FrAngel: component-based synthesis with control structures
inferredcites →https://doi.org/10.1145/3385412.3386027openalex-snapshot
Reconciling enumerative and deductive program synthesis
inferredcites →https://doi.org/10.1145/3408991openalex-snapshot
Program sketching with live bidirectional evaluation
inferredcites →https://doi.org/10.1145/3434335openalex-snapshot
Combining the top-down propagation and bottom-up enumeration for inductive program synthesis
inferredcites →https://doi.org/10.1145/945645.945654openalex-snapshot
Learning programs from traces using version space algebra
inferredcites →https://doi.org/10.4230/lipics.csl.2011.428openalex-snapshot
Synthesizing Reactive Programs
inferredcites →https://doi.org/10.48550/arxiv.2007.14381openalex-snapshot
BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Exploration
inferredcites →https://doi.org/10.5555/1248547.1248562openalex-snapshot
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
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-22308-2_13openalex-snapshot
Bootstrapping Library-Based Synthesis
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-63498-7_10openalex-snapshot
Synthesis of Recursive Programs in Saturation
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/978-3-032-22723-2_13openalex-snapshot
Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs
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/iicspi66775.2025.11437651openalex-snapshot
Lightweight Dual-Branch Attention Network for End-to-End Raw Audio Classification
inferred← citeshttps://doi.org/10.1109/vl/hcc60511.2024.00035openalex-snapshot
Generating Function Names to Improve Comprehension of Synthesized Programs
inferred← citeshttps://doi.org/10.1145/3519939.3523726openalex-snapshot
Recursion synthesis with unrealizability witnesses
inferred← citeshttps://doi.org/10.1145/3563306openalex-snapshot
Data-driven lemma synthesis for interactive proofs
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/3586032openalex-snapshot
Languages with Decidable Learning: A Meta-theorem
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/3622830openalex-snapshot
Inductive Program Synthesis Guided by Observational Program Similarity
inferred← citeshttps://doi.org/10.1145/3622876openalex-snapshot
Message Chains for Distributed System Verification
inferred← citeshttps://doi.org/10.1145/3632860openalex-snapshot
Programming-by-Demonstration for Long-Horizon Robot Tasks
inferred← citeshttps://doi.org/10.1145/3632894openalex-snapshot
Efficient Bottom-Up Synthesis for Programs with Local Variables
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/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/3656418openalex-snapshot
From Batch to Stream: Automatic Generation of Online Algorithms
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/3656464openalex-snapshot
PL4XGL: A Programming Language Approach to Explainable Graph Learning
inferred← citeshttps://doi.org/10.1145/3689724openalex-snapshot
Synthesizing Formal Semantics from Executable Interpreters
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/3763072openalex-snapshot
Homomorphism Calculus for User-Defined Aggregations
inferred← citeshttps://doi.org/10.1145/3763158openalex-snapshot
We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators
inferred← citeshttps://doi.org/10.1145/3763176openalex-snapshot
Tunneling through the Hill: Multi-way Intersection for Version-Space Algebras in Program Synthesis
inferred← citeshttps://doi.org/10.1145/3772318.3791327openalex-snapshot
Programming By Scaffolded Demonstration with Perpend
inferred← citeshttps://doi.org/10.1145/3814885.3816413openalex-snapshot
Synthesizing Recursive Functional Programs via Structure-Element Separation
inferred← citeshttps://doi.org/10.1177/07356331251396440openalex-snapshot
Exploring the Link Between Problem-Solving Strategies and Programming Performance: A Comparative Analysis of High and Low Performers
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.