On the public citation graph

Relational program synthesis

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.1007/11513988_23openalex-snapshot
Program Repair as a Game
inferredcites →https://doi.org/10.1007/978-1-4612-5695-3openalex-snapshot
Selected Writings on Computing: A personal Perspective
inferredcites →https://doi.org/10.1007/978-3-319-66706-5_18openalex-snapshot
Synthesizing Imperative Programs from Examples Guided by Static Analysis
inferredcites →https://doi.org/10.1007/978-3-540-68237-0_5openalex-snapshot
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
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-21437-0_17openalex-snapshot
Relational Verification Using Product Programs
inferredcites →https://doi.org/10.1007/978-3-642-31113-0_1openalex-snapshot
Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs
inferredcites →https://doi.org/10.1007/978-3-642-35722-0_3openalex-snapshot
Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification
inferredcites →https://doi.org/10.1007/978-3-662-53413-7_8openalex-snapshot
Relational Verification Through Horn Clause Transformation
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/bf01211087openalex-snapshot
Running programs backwards: The logical inversion of imperative computation
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
inferredcites →https://doi.org/10.1016/0166-218x(93)90045-popenalex-snapshot
Directed hypergraphs and applications
inferredcites →https://doi.org/10.1016/0167-6423(90)90042-copenalex-snapshot
Program inversion: More than fun!
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50019-2openalex-snapshot
APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This…
inferredcites →https://doi.org/10.1016/c2013-0-07696-7openalex-snapshot
Readings in Artificial Intelligence and Software Engineering
inferredcites →https://doi.org/10.1016/j.jlamp.2016.05.004openalex-snapshot
Product programs and relational program logics
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1023/a:1025671410623openalex-snapshot
Programming by Demonstration Using Version Space Algebra
inferredcites →https://doi.org/10.1109/csfw.2004.17openalex-snapshot
Secure information flow by self-composition
inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot
Syntax-guided synthesis
inferredcites →https://doi.org/10.1109/synasc.2012.69openalex-snapshot
Synthesis from Examples: Interaction Models and Algorithms
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
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/1993316.1993557openalex-snapshot
Path-based inductive synthesis for program inversion
inferredcites →https://doi.org/10.1145/1993498.1993557openalex-snapshot
Path-based inductive synthesis for program inversion
inferredcites →https://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferredcites →https://doi.org/10.1145/2451116.2451150openalex-snapshot
Stochastic superoptimization
inferredcites →https://doi.org/10.1145/2509136.2509555openalex-snapshot
Synthesis modulo recursive functions
inferredcites →https://doi.org/10.1145/2594291.2594305openalex-snapshot
Consolidation of queries with user-defined functions
inferredcites →https://doi.org/10.1145/2676726.2677006openalex-snapshot
Fiat
inferredcites →https://doi.org/10.1145/2676726.2677009openalex-snapshot
Predicting Program Properties from "Big Code"
inferredcites →https://doi.org/10.1145/2737924.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.2837671openalex-snapshot
Learning programs from noisy data
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/2908080.2908121openalex-snapshot
Stratified synthesis: automatically learning the x86-64 instruction set
inferredcites →https://doi.org/10.1145/2983990.2984030openalex-snapshot
FIDEX: filtering spreadsheet data using examples
inferredcites →https://doi.org/10.1145/3062341.3062345openalex-snapshot
Automatic program inversion using symbolic transducers
inferredcites →https://doi.org/10.1145/3133886openalex-snapshot
Synthesis of data completion scripts using finite tree automata
inferredcites →https://doi.org/10.1145/3133956.3134058openalex-snapshot
Precise Detection of Side-Channel Vulnerabilities using Quantitative Cartesian Hoare Logic
inferredcites →https://doi.org/10.1145/3158144openalex-snapshot
Verifying equivalence of database-driven applications
inferredcites →https://doi.org/10.1145/3158151openalex-snapshot
Program synthesis using abstraction refinement
inferredcites →https://doi.org/10.1145/3187009.3177735openalex-snapshot
Automated migration of hierarchical data to relational tables using programming-by-example
inferredcites →https://doi.org/10.1145/3276535openalex-snapshot
Verified three-way program merge
inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot
A Deductive Approach to Program Synthesis
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.29007/gr5copenalex-snapshot
Synchronizing Constrained Horn Clauses
inferredcites →https://doi.org/10.5555/2486788.2486890openalex-snapshot
SemFix: program repair via semantic analysis

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-53291-8_32openalex-snapshot
Decidable Synthesis of Programs with Uninterpreted Functions
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.1145/3314221.3314588openalex-snapshot
Synthesizing database programs for schema refactoring
inferred← citeshttps://doi.org/10.1145/3371124openalex-snapshot
Augmented example-based synthesis using relational perturbation properties
inferred← citeshttps://doi.org/10.1145/3385412.3386025openalex-snapshot
Question selection for interactive program synthesis
inferred← citeshttps://doi.org/10.1145/3498671openalex-snapshot
Learning formulas in finite variable logics
inferred← citeshttps://doi.org/10.1145/3498682openalex-snapshot
Bottom-up synthesis of recursive functional programs using angelic execution
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/3622800openalex-snapshot
Synthesizing Efficient Memoization Algorithms
inferred← citeshttps://doi.org/10.1145/3632860openalex-snapshot
Programming-by-Demonstration for Long-Horizon Robot Tasks
inferred← citeshttps://doi.org/10.1145/3632870openalex-snapshot
Semantic Code Refactoring for Abstract Data Types
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/3656418openalex-snapshot
From Batch to Stream: Automatic Generation of Online Algorithms
inferred← citeshttps://doi.org/10.1145/3763073openalex-snapshot
Synthesizing DSLs for Few-Shot Learning
inferred← citeshttps://doi.org/10.2197/ipsjjip.32.471openalex-snapshot
SYNTHBX: An Example-guided Synthesizer for Bidirectional Programs on Relations
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03534openalex-snapshot
Learning Formulas in Finite Variable Logics
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.