On the public citation graph

Generalizable synthesis through unification

https://doi.org/10.1145/3485544
0 signed · 69 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.1995.1037openalex-snapshot
A Markovian Extension of Valiant′s Learning Model
inferredcites →https://doi.org/10.1007/3-540-59042-0_102openalex-snapshot
Lower bounds on learning decision lists and trees
inferredcites →https://doi.org/10.1007/978-3-030-25540-4_15openalex-snapshot
Efficient Synthesis with Probabilistic Constraints
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_5openalex-snapshot
cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_10openalex-snapshot
Synthesis Through Unification
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_23openalex-snapshot
Predicting a Correct Program in Programming by Example
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-32512-0_24openalex-snapshot
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_18openalex-snapshot
Scaling Enumerative Program Synthesis via Divide and Conquer
inferredcites →https://doi.org/10.1007/s00236-017-0294-5openalex-snapshot
A theory of formal synthesis via inductive learning
inferredcites →https://doi.org/10.1016/0020-0190(87)90114-1openalex-snapshot
Occam's Razor
inferredcites →https://doi.org/10.1016/s0022-0000(05)80062-5openalex-snapshot
Efficient distribution-free learning of probabilistic concepts
inferredcites →https://doi.org/10.1023/a:1022607331053openalex-snapshot
Learning Decision Lists
inferredcites →https://doi.org/10.1023/a:1022643204877openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1023/a:1022873112823openalex-snapshot
Learning From Noisy Examples
inferredcites →https://doi.org/10.1023/a:1025671410623openalex-snapshot
Programming by Demonstration Using Version Space Algebra
inferredcites →https://doi.org/10.1109/32.908957openalex-snapshot
Dynamically discovering likely program invariants to support program evolution
inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot
Syntax-guided synthesis
inferredcites →https://doi.org/10.1109/icse.2015.63openalex-snapshot
DirectFix: Looking for Simple Program Repairs
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1168919.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1250734.1250752openalex-snapshot
Automatic inversion generates divide-and-conquer parallel programs
inferredcites →https://doi.org/10.1145/1273442.1250752openalex-snapshot
Automatic inversion generates divide-and-conquer parallel programs
inferredcites →https://doi.org/10.1145/130385.130399openalex-snapshot
PAC-learnability of determinate logic programs
inferredcites →https://doi.org/10.1145/168304.168380openalex-snapshot
Occam's razor for functions
inferredcites →https://doi.org/10.1145/1806799.1806833openalex-snapshot
Oracle-guided component-based program synthesis
inferredcites →https://doi.org/10.1145/1926385.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/2807442.2807459openalex-snapshot
User Interaction Models for Disambiguation in Programming by Example
inferredcites →https://doi.org/10.1145/2837614.2837671openalex-snapshot
Learning programs from noisy data
inferredcites →https://doi.org/10.1145/2884781.2884881openalex-snapshot
Automatic model generation from documentation for Java API functions
inferredcites →https://doi.org/10.1145/2914770.2837671openalex-snapshot
Learning programs from noisy data
inferredcites →https://doi.org/10.1145/3035918.3058738openalex-snapshot
Interactive Query Synthesis from Input-Output Examples
inferredcites →https://doi.org/10.1145/3062341.3062355openalex-snapshot
Synthesis of divide and conquer parallelism for loops
inferredcites →https://doi.org/10.1145/3106237.3106309openalex-snapshot
S3: syntax- and semantic-guided repair synthesis via programming by examples
inferredcites →https://doi.org/10.1145/3140587.3062355openalex-snapshot
Synthesis of divide and conquer parallelism for loops
inferredcites →https://doi.org/10.1145/3192366.3192410openalex-snapshot
Accelerating search-based program synthesis using learned probabilistic models
inferredcites →https://doi.org/10.1145/3236024.3236049openalex-snapshot
Symbolic execution with existential second-order constraints
inferredcites →https://doi.org/10.1145/3276520openalex-snapshot
FlashProfile: a framework for synthesizing data profiles
inferredcites →https://doi.org/10.1145/3296979.3192410openalex-snapshot
Accelerating search-based program synthesis using learned probabilistic models
inferredcites →https://doi.org/10.1145/3338906.3338951openalex-snapshot
Maximal multi-layer specification synthesis
inferredcites →https://doi.org/10.1145/3385412.3385979openalex-snapshot
Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems
inferredcites →https://doi.org/10.1145/3385412.3386025openalex-snapshot
Question selection for interactive program synthesis
inferredcites →https://doi.org/10.1145/3385412.3386027openalex-snapshot
Reconciling enumerative and deductive program synthesis
inferredcites →https://doi.org/10.1145/3428292openalex-snapshot
Guiding dynamic programing via structural probability for accelerating programming by example
inferredcites →https://doi.org/10.1145/3434311openalex-snapshot
Semantics-guided synthesis
inferredcites →https://doi.org/10.1145/3459637.3481972openalex-snapshot
PRASEMap
inferredcites →https://doi.org/10.1145/62212.62238openalex-snapshot
Learning in the presence of malicious errors
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.14722/bar.2020.23009openalex-snapshot
QSynth - A Program Synthesis based approach for Binary Code Deobfuscation
inferredcites →https://doi.org/10.1613/jair.1917openalex-snapshot
Pac-learning Recursive Logic Programs: Negative Results
inferredcites →https://doi.org/10.1613/jair.97openalex-snapshot
Pac-Learning Recursive Logic Programs: Efficient Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1703.07469openalex-snapshot
RobustFill: Neural Program Learning under Noisy I/O
inferredcites →https://doi.org/10.5281/zenodo.5499719openalex-snapshot
Artifact for OOPSLA'21: Generalizable Synthesis Through Unification
inferredcites →https://doi.org/10.5555/1622826.1622843openalex-snapshot
Pac-learning recursive logic programs

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.5499720zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1145/3586055openalex-snapshot
Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection
inferred← citeshttps://doi.org/10.1145/3591255openalex-snapshot
Trace-Guided Inductive Synthesis of Recursive Functional Programs
inferred← citeshttps://doi.org/10.1145/3607185openalex-snapshot
Programming by Example Made Easy
inferred← citeshttps://doi.org/10.1145/3618305.3623586openalex-snapshot
Scaling up Program Synthesis to Efficient Algorithms
inferred← citeshttps://doi.org/10.1145/3622800openalex-snapshot
Synthesizing Efficient Memoization Algorithms
inferred← citeshttps://doi.org/10.1145/3622847openalex-snapshot
Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates
inferred← citeshttps://doi.org/10.1145/3632913openalex-snapshot
Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector Manipulations
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/3720420openalex-snapshot
Inductive Synthesis of Inductive Heap Predicates
inferred← citeshttps://doi.org/10.1145/3729336openalex-snapshot
A Concurrent Approach to String Transformation Synthesis
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/3776679openalex-snapshot
Accelerating Syntax-Guided Program Synthesis by Optimizing Domain-Specific Languages
inferred← citeshttps://doi.org/10.1145/3839460openalex-snapshot
Incremental Program Synthesis from Event Logs
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.