On the public citation graph

Search-based program synthesis

https://doi.org/10.1145/3208071

0 signed · 109 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-08867-9_5openalex-snapshot

ICE: A Robust Framework for Learning Invariants

inferredcites →https://doi.org/10.1007/bf00116251openalex-snapshot

Induction of Decision Trees

inferredcites →https://doi.org/10.1007/s10009-012-0223-4openalex-snapshot

Template-based program verification and program synthesis

inferredcites →https://doi.org/10.1007/s10009-012-0249-7openalex-snapshot

Program sketching

inferredcites →https://doi.org/10.1109/32.153379openalex-snapshot

Fundamentals of deductive program synthesis

inferredcites →https://doi.org/10.1109/jproc.2015.2471838openalex-snapshot

Combining Induction, Deduction, and Structure for Verification and Synthesis

inferredcites →https://doi.org/10.1145/1065010.1065045openalex-snapshot

Programming by sketching for bit-streaming programs

inferredcites →https://doi.org/10.1145/1536616.1536637openalex-snapshot

Boolean satisfiability from theoretical hardness to practical success

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/1993498.1993506openalex-snapshot

Synthesis of loop-free programs

inferredcites →https://doi.org/10.1145/1995376.1995394openalex-snapshot

Satisfiability modulo theories

inferredcites →https://doi.org/10.1145/2076450.2076472openalex-snapshot

Software synthesis procedures

inferredcites →https://doi.org/10.1145/2240236.2240260openalex-snapshot

Spreadsheet data manipulation using examples

inferredcites →https://doi.org/10.1145/2491956.2462174openalex-snapshot

TRANSIT

inferredcites →https://doi.org/10.1145/2594291.2594321openalex-snapshot

Code completion with statistical language models

inferredcites →https://doi.org/10.1145/2737924.2738007openalex-snapshot

Type-and-example-directed program synthesis

inferredcites →https://doi.org/10.1145/2863701openalex-snapshot

Stochastic program optimization

inferredcites →https://doi.org/10.1145/2884781.2884807openalex-snapshot

Angelix

inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot

Program synthesis from polymorphic refinement types

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/36206.36194openalex-snapshot

Superoptimizer: a look at the smallest program

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.70277openalex-snapshot

A Survey of the Full Process of Code Search Based on Deep Learning

inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_17openalex-snapshot

Overfitting in Synthesis: Theory and Practice

inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_8openalex-snapshot

Counterexample-Driven Synthesis for Probabilistic Program Sketches

inferred← citeshttps://doi.org/10.1007/978-3-030-31423-1_7openalex-snapshot

Constraint Learning: An Appetizer

inferred← citeshttps://doi.org/10.1007/978-3-030-31514-6_7openalex-snapshot

Model Repair Revamped

inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_10openalex-snapshot

Synthesizing Environment Invariants for Modular Hardware Verification

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-030-53291-8_9openalex-snapshot

Code2Inv: A Deep Learning Framework for Program Verification

inferred← citeshttps://doi.org/10.1007/978-3-030-63461-2_24openalex-snapshot

Algebra-Based Loop Synthesis

inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_24openalex-snapshot

Repairing Real-Time Requirements

inferred← citeshttps://doi.org/10.1007/978-3-031-22064-7_33openalex-snapshot

Deterministic Graph-Walking Program Mining

inferred← citeshttps://doi.org/10.1007/978-3-031-33271-5_25openalex-snapshot

Boolean-Arithmetic Equations: Acquisition and Uses

inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_12openalex-snapshot

Verifying the Verifier: eBPF Range Analysis Verification

inferred← citeshttps://doi.org/10.1007/978-3-031-77792-9_12openalex-snapshot

LLM-Driven Knowledge Extraction in Temporal and Description Logics

inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_6openalex-snapshot

Automatically Tightening Access Control Policies with Restricter

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_15openalex-snapshot

Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability

inferred← citeshttps://doi.org/10.1007/s00165-021-00547-2openalex-snapshot

Counterexample-guided inductive synthesis for probabilistic systems

inferred← citeshttps://doi.org/10.1007/s00766-020-00342-0openalex-snapshot

RAPID: a knowledge-based assistant for designing web APIs

inferred← citeshttps://doi.org/10.1007/s10703-021-00386-0openalex-snapshot

Special Issue on Syntax-Guided Synthesis Preface

inferred← citeshttps://doi.org/10.1007/s10703-023-00430-1openalex-snapshot

Machine learning and logic: a new frontier in artificial intelligence

inferred← citeshttps://doi.org/10.1007/s10710-022-09434-yopenalex-snapshot

Applying genetic programming to PSB2: the next generation program synthesis benchmark suite

inferred← citeshttps://doi.org/10.1016/j.artint.2022.103794openalex-snapshot

Learning MAX-SAT from contextual examples for combinatorial optimisation

inferred← citeshttps://doi.org/10.1016/j.artint.2023.103962openalex-snapshot

Iterative genetic improvement: Scaling stochastic program synthesis

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104097openalex-snapshot

Generalized planning as heuristic search: A new planning search-space that leverages pointers over objects

inferred← citeshttps://doi.org/10.1109/access.2022.3183091openalex-snapshot

Program Synthesis Through Learning the Input-Output Behavior of Commands

inferred← citeshttps://doi.org/10.1109/apsec60848.2023.00050openalex-snapshot

Parameterized Search Heuristic Prediction for Concolic Execution

inferred← citeshttps://doi.org/10.1109/asp-dac66049.2026.11420401openalex-snapshot

Formalization of Rectification Learning for Economic Design Updates

inferred← citeshttps://doi.org/10.1109/icse-companion52605.2021.00094openalex-snapshot

PASTA: Synthesizing Object State Transformers for Dynamic Software Updates

inferred← citeshttps://doi.org/10.1109/icse43902.2021.00103openalex-snapshot

Synthesizing Object State Transformers for Dynamic Software Updates

inferred← citeshttps://doi.org/10.1109/isca52012.2021.00050openalex-snapshot

CoSA: Scheduling by Constrained Optimization for Spatial Accelerators

inferred← citeshttps://doi.org/10.1109/saner56733.2023.00112openalex-snapshot

Deep Reinforcement Learning Guided Decision Tree Learning For Program Synthesis

inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179393openalex-snapshot

Less is more: refinement proofs for probabilistic proofs

inferred← citeshttps://doi.org/10.1109/sp54263.2024.00180openalex-snapshot

ConjunCT: Learning Inductive Invariants to Prove Unbounded Instruction Safety Against Microarchitectural Timing Attacks

inferred← citeshttps://doi.org/10.1109/tevc.2024.3525006openalex-snapshot

Fitness Landscape Optimization Makes Stochastic Symbolic Search by Genetic Programming Easier

inferred← citeshttps://doi.org/10.1109/tse.2020.3018481openalex-snapshot

Deep Learning Based Program Generation From Requirements Text: Are We There Yet?

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/3299902.3311069openalex-snapshot

Basic and Advanced Researches in Logic Synthesis and their Industrial Contributions

inferred← citeshttps://doi.org/10.1145/3318162openalex-snapshot

Automated program repair

inferred← citeshttps://doi.org/10.1145/3377811.3380415openalex-snapshot

Fuzz testing based data augmentation to improve robustness of deep neural networks

inferred← citeshttps://doi.org/10.1145/3377930.3390208openalex-snapshot

Synthesis through unification genetic programming

inferred← citeshttps://doi.org/10.1145/3385412.3386027openalex-snapshot

Reconciling enumerative and deductive program synthesis

inferred← citeshttps://doi.org/10.1145/3428295openalex-snapshot

Just-in-time learning for bottom-up enumerative synthesis

inferred← citeshttps://doi.org/10.1145/3452296.3472929openalex-snapshot

Synthesizing safe and efficient kernel extensions for packet processing

inferred← citeshttps://doi.org/10.1145/3453483.3454051openalex-snapshot

Concolic program repair

inferred← citeshttps://doi.org/10.1145/3453483.3454098openalex-snapshot

Example-guided synthesis of relational queries

inferred← citeshttps://doi.org/10.1145/3524482.3527656openalex-snapshot

Generating counterexamples in the form of unit tests from hoare-style verification attempts

inferred← citeshttps://doi.org/10.1145/3527458openalex-snapshot

Algebra-Based Reasoning for Loop Synthesis

inferred← citeshttps://doi.org/10.1145/3555367openalex-snapshot

The Premature Obituary of Programming

inferred← citeshttps://doi.org/10.1145/3563354openalex-snapshot

Model-guided synthesis of inductive lemmas for FOL with least fixpoints

inferred← citeshttps://doi.org/10.1145/3583131.3590502openalex-snapshot

Solving Novel Program Synthesis Problems with Genetic Programming using Parametric Polymorphism

inferred← citeshttps://doi.org/10.1145/3583133.3596373openalex-snapshot

Human-Driven Genetic Programming for Program Synthesis: A Prototype

inferred← citeshttps://doi.org/10.1145/3586052openalex-snapshot

Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs

inferred← citeshttps://doi.org/10.1145/3587691openalex-snapshot

Low-Code Programming Models

inferred← citeshttps://doi.org/10.1145/3622800openalex-snapshot

Synthesizing Efficient Memoization Algorithms

inferred← citeshttps://doi.org/10.1145/3622869openalex-snapshot

Saggitarius: A DSL for Specifying Grammatical Domains

inferred← citeshttps://doi.org/10.1145/3632901openalex-snapshot

A Case for Synthesis of Recursive Quantum Unitary Programs

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/3639478.3643529openalex-snapshot

NomNom: Explanatory Function Names for Program Synthesizers

inferred← citeshttps://doi.org/10.1145/3656464openalex-snapshot

PL4XGL: A Programming Language Approach to Explainable Graph Learning

inferred← citeshttps://doi.org/10.1145/3663529.3663802openalex-snapshot

ASAC: A Benchmark for Algorithm Synthesis

inferred← citeshttps://doi.org/10.1145/3689723openalex-snapshot

libLISA: Instruction Discovery and Analysis on x86-64

inferred← citeshttps://doi.org/10.1145/3704862openalex-snapshot

Simple Linear Loops: Algebraic Invariants and Applications

inferred← citeshttps://doi.org/10.1145/3708519openalex-snapshot

Automatic Programming: Large Language Models and Beyond

inferred← citeshttps://doi.org/10.1145/3768578openalex-snapshot

CUBES: A Parallel Synthesizer for SQL Using Examples

inferred← citeshttps://doi.org/10.14778/3407790.3407800openalex-snapshot

Data market platforms

inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5877openalex-snapshot

Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation

inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5967openalex-snapshot

Learning Weighted Model Integration Distributions

inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5996openalex-snapshot

Synthesizing Action Sequences for Modifying Model Decisions

inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6550openalex-snapshot

Generalized Planning with Positive and Negative Examples

inferred← citeshttps://doi.org/10.1609/aaai.v36i6.20616openalex-snapshot

Scaling Neural Program Synthesis with Distribution-Based Search

inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28641openalex-snapshot

Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae

inferred← citeshttps://doi.org/10.1609/icaps.v31i1.16005openalex-snapshot

Generalized Planning as Heuristic Search

inferred← citeshttps://doi.org/10.24963/ijcai.2020/306openalex-snapshot

Learning Interpretable Models in the Property Specification Language

inferred← citeshttps://doi.org/10.24963/ijcai.2022/466openalex-snapshot

Composing Neural Learning and Symbolic Reasoning with an Application to Visual Discrimination

inferred← citeshttps://doi.org/10.24963/ijcai.2022/746openalex-snapshot

Computing Programs for Generalized Planning as Heuristic Search (Extended Abstract)

inferred← citeshttps://doi.org/10.29007/njphopenalex-snapshot

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers

inferred← citeshttps://doi.org/10.29007/slrmopenalex-snapshot

Experiments on Infinite Model Finding in SMT Solving

inferred← citeshttps://doi.org/10.3390/info16050401openalex-snapshot

Review and Mapping of Search-Based Approaches for Program Synthesis

inferred← citeshttps://doi.org/10.34727/2020/isbn.978-3-85448-042-6_16openalex-snapshot

SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces

inferred← citeshttps://doi.org/10.48550/arxiv.1905.07457openalex-snapshot

Overfitting in Synthesis: Theory and Practice (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.2002.01047openalex-snapshot

Data Market Platforms: Trading Data Assets to Solve Data Problems

inferred← citeshttps://doi.org/10.48550/arxiv.2009.10207openalex-snapshot

Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints

inferred← citeshttps://doi.org/10.48550/arxiv.2011.07630openalex-snapshot

Safety Synthesis Sans Specification

inferred← citeshttps://doi.org/10.48550/arxiv.2107.07136openalex-snapshot

Learning Mixed-Integer Linear Programs from Contextual Examples

inferred← citeshttps://doi.org/10.5381/jot.2024.23.2.a3openalex-snapshot

Toward Using Fuzzers and Lightweight Specifications to Reveal Semantic Bugs.

inferred← citeshttps://doi.org/10.70675/1bd8de32zdfc1z4140z8f9az99893ad358adopenalex-snapshot

Apprentissage de modèles à contraintes concis à partir de données sans erreurs : études sur l’acquisition d’équations arithmétiques booléennes et de modèles d’ordonnancement à court terme

inferred← citeshttps://doi.org/10.70675/a8b3c410zb7d6z40a1z8398z6d386e64da0aopenalex-snapshot

Projecting Computer Languages for a Protean Interaction

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.