Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,944,452 papers from all fields of science
Search
Sign In
Create Free Account
Program synthesis
Program synthesis is a special form of automatic programming that is most often paired with a technique for formal verification. The goal is to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
AI winter
Algorithm
Artificial intelligence
Automatic programming
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Data Curation with Deep Learning [Vision]: Towards Self Driving Data Curation
Saravanan Thirumuruganathan
,
N. Tang
,
M. Ouzzani
arXiv.org
2018
Corpus ID: 3687985
Past. Data curation - the process of discovering, integrating, and cleaning data - is one of the oldest data management problems…
Expand
2017
2017
Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis
A. Gascón
,
A. Tiwari
,
Brent Carmer
,
Umang Mathur
International Conference on Computer Aided…
2017
Corpus ID: 27836459
We introduce a technique for component-based program synthesis that relies on searching for a target program and its proof of…
Expand
2013
2013
A Framework for Knowledge Management and Automated Constraint Monitoring
A. Gates
2013
Corpus ID: 5886231
This paper describes an approach called Dynamic Monitoring with Integrity Constraints (DynaMICs) that consists of a specification…
Expand
2005
2005
Applications of inductive definitions and choice principles to program synthesis
Seisenberger Monika
2005
Corpus ID: 14488725
We describe two methods of extracting constructive content from classical proofs, focusing on theorems involving infinite…
Expand
1993
1993
Inductive Inference of Prolog Programs with Linear Data Dependency from Positive Data
Hiroki Arimura
,
有村 博紀
,
T. Shinohara
,
篠原 武
1993
Corpus ID: 18167129
In this paper, we study inductive inference of a subclass of Prolog programs from positive examples. The subclass, called…
Expand
1992
1992
Using type transformation in database system implementation
L. Fegaras
,
D. Stemple
1992
Corpus ID: 18174230
We propose the use of semi-automatic methods for the translation of abstract database programs into efficient lower level user…
Expand
1986
1986
Reasoning with Simplifying Assumptions: A Methodology and Example
Y. Feldman
,
C. Rich
AAAI Conference on Artificial Intelligence
1986
Corpus ID: 18246186
Simplifying assumptions are a powerful technique for dealing with complexity, which is used in all branches of science and…
Expand
1986
1986
Knuth-Bendix Completion versus Fold/Unfold: a Comparative Study in Program Synthesis
B. Fronhöfer
,
U. Furbach
German Workshop on Artificial Intelligence
1986
Corpus ID: 42882762
This paper is a comparative study in program synthesis. Two approaches — program synthesis by means of the Knuth-Bendix…
Expand
1977
1977
A Summary of the PSI Program Synthesis System
C. Green
International Joint Conference on Artificial…
1977
Corpus ID: 26263841
This paper describes the current status of the PSI program synthesis system. It allows program specification dialogues using…
Expand
1976
1976
Observations on the interaction between coding and efficiency knowledge in the PSI Program Synthesis System
D. Barstow
,
Elaine Kant
International Conference on Software Engineering
1976
Corpus ID: 16841446
This paper discusses how the synthesis phase of the PSI system constructs programs from high level program models by using coding…
Expand