On the public citation graph
Program synthesis by type-guided abstraction refinement
0 signed · 84 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-62688-3_47openalex-snapshot
Inhabitation in typed lambda-calculi (a syntactic approach)
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_40openalex-snapshot
An SMT-Based Approach to Coverability Analysis
inferredcites →https://doi.org/10.1007/978-3-319-47166-2_21openalex-snapshot
A Long and Winding Road Towards Modular Synthesis
inferredcites →https://doi.org/10.1007/978-3-540-73094-1_10openalex-snapshot
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
inferredcites →https://doi.org/10.1007/978-3-540-73589-2_2openalex-snapshot
Gradual Typing for Objects
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-04652-0_5openalex-snapshot
Dependently Typed Programming in Agda
inferredcites →https://doi.org/10.1007/978-3-642-13754-9_4openalex-snapshot
The Localization Reduction and Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_10openalex-snapshot
Incremental, Inductive Coverability
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.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/cbo9781107325944.004openalex-snapshot
Proof Search in Constructive Logics
inferredcites →https://doi.org/10.1017/s0956796800000861openalex-snapshot
Deciding type isomorphisms in a type-assignment framework
inferredcites →https://doi.org/10.1017/s0956796817000016openalex-snapshot
Modular, higher order cardinality analysis in theory and practice
inferredcites →https://doi.org/10.1145/1481861.1481862openalex-snapshot
Dependently typed programming in Agda
inferredcites →https://doi.org/10.1145/1706299.1706337openalex-snapshot
From program verification to 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/2103746.2103758openalex-snapshot
An analytical inductive functional programming system that avoids unintended programs
inferredcites →https://doi.org/10.1145/2254064.2254098openalex-snapshot
Type-directed completion of partial expressions
inferredcites →https://doi.org/10.1145/2491956.2462192openalex-snapshot
Complete completion using types and weights
inferredcites →https://doi.org/10.1145/2568225.2568250openalex-snapshot
CodeHint: dynamic and interactive synthesis of code snippets
inferredcites →https://doi.org/10.1145/2594291.2594321openalex-snapshot
Code completion with statistical language models
inferredcites →https://doi.org/10.1145/263699.263744openalex-snapshot
Types as abstract interpretations
inferredcites →https://doi.org/10.1145/2666356.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/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/3009837.3009851openalex-snapshot
Component-based synthesis for complex APIs
inferredcites →https://doi.org/10.1145/3106237.3106284openalex-snapshot
Bayesian specification learning for finding API usage errors
inferredcites →https://doi.org/10.1145/3192366.3192410openalex-snapshot
Accelerating search-based program synthesis using learned probabilistic models
inferredcites →https://doi.org/10.1145/3290386openalex-snapshot
FrAngel: component-based synthesis with control structures
inferredcites →https://doi.org/10.1145/75277.75283openalex-snapshot
How to make ad-hoc polymorphism less ad hoc
inferredcites →https://doi.org/10.48550/arxiv.1710.07740openalex-snapshot
Program Synthesis using Abstraction Refinement
inferredcites →https://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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-24841-2_2openalex-snapshot
Program Synthesis Using Example Propagation
inferred← citeshttps://doi.org/10.1007/978-981-16-8113-4_3openalex-snapshot
Grammatical Evolution Mapping for Semantically-Constrained Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-981-97-0844-4_3openalex-snapshot
AL-SQUARES: SQL Synthesis System with the Addition of Reducer
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100714openalex-snapshot
Defining behaviorizeable relations to enable inference in semi-automatic program synthesis
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678705openalex-snapshot
A Program Synthesis Approach for Adding Architectural Tactics to An Existing Code Base
inferred← citeshttps://doi.org/10.1109/icse43902.2021.00023openalex-snapshot
SOAR: A Synthesis Approach for Data Science API Refactoring
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00152openalex-snapshot
Synthesizing Document Database Queries Using Collection Abstractions
inferred← citeshttps://doi.org/10.1109/icst57152.2023.00035openalex-snapshot
Spectacular: Finding Laws from 25 Trillion Terms
inferred← citeshttps://doi.org/10.1109/qrs65678.2025.00075openalex-snapshot
PinChecker: Identifying Unsound Safe Abstractions of Rust Pinning APIs
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.1117/12.3011627openalex-snapshot
Survey of intelligent program synthesis techniques
inferred← citeshttps://doi.org/10.1145/3408991openalex-snapshot
Program sketching with live bidirectional evaluation
inferred← citeshttps://doi.org/10.1145/3414080.3414081openalex-snapshot
Continuous Verification of Machine Learning: a Declarative Programming Approach
inferred← citeshttps://doi.org/10.1145/3428227openalex-snapshot
Programming with a read-eval-synth loop
inferred← citeshttps://doi.org/10.1145/3428245openalex-snapshot
Dataflow-based pruning for speeding up superoptimization
inferred← citeshttps://doi.org/10.1145/3428273openalex-snapshot
Digging for fold: synthesis-aided API discovery for Haskell
inferred← citeshttps://doi.org/10.1145/3453483.3454084openalex-snapshot
SyRust: automatic testing of Rust libraries with semantic-aware program synthesis
inferred← citeshttps://doi.org/10.1145/3519939.3523450openalex-snapshot
Type-directed program synthesis for RESTful APIs
inferred← citeshttps://doi.org/10.1145/3563310openalex-snapshot
Specification-guided component-based synthesis from effectful libraries
inferred← citeshttps://doi.org/10.1145/3571226openalex-snapshot
FlashFill++: Scaling Programming by Example by Cutting to the Chase
inferred← citeshttps://doi.org/10.1145/3586052openalex-snapshot
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs
inferred← citeshttps://doi.org/10.1145/3591288openalex-snapshot
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3591298openalex-snapshot
Synthesizing MILP Constraints for Efficient and Robust Optimization
inferred← citeshttps://doi.org/10.1145/3620666.3651366openalex-snapshot
SIRO: Empowering Version Compatibility in Intermediate Representations via Program Synthesis
inferred← citeshttps://doi.org/10.1145/3632904openalex-snapshot
API-Driven Program Synthesis for Testing Static Typing Implementations
inferred← citeshttps://doi.org/10.1145/3637792.3637793openalex-snapshot
Improve Software Development: An Overview of Program Synthesis
inferred← citeshttps://doi.org/10.1145/3649837openalex-snapshot
Hydra: Generalizing Peephole Optimizations with Program Synthesis
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/3678000openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3678000.3678207openalex-snapshot
Towards Type-Directed API Search for Mainstream Languages
inferred← citeshttps://doi.org/10.1145/3720449openalex-snapshot
API-Guided Dataset Synthesis to Finetune Large Code Models
inferred← citeshttps://doi.org/10.1145/3729316openalex-snapshot
Program Synthesis from Partial Traces
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/3779209.3779535openalex-snapshot
Hole Refinements for Polymorphic Type-and-Example Driven Synthesis
inferred← citeshttps://doi.org/10.1145/3839460openalex-snapshot
Incremental Program Synthesis from Event Logs
inferred← citeshttps://doi.org/10.20535/srit.2308-8893.2021.1.02openalex-snapshot
Reduction conceptualization of oracle schemes
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25ccfopenalex-snapshot
Directed Reachability for Infinite-State Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2104.13315openalex-snapshot
Inductive Program Synthesis over Noisy Datasets using Abstraction Refinement Based Optimization
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.