Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics

In top-down enumeration for program synthesis, abstraction-based pruning uses an abstract domain to approximate the set of possible values that a partial program, when completed, can output on a given input. If the set does not contain the desired output, the partial program and all its possible com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages 2024-10, Vol.8 (OOPSLA2), p.935-961, Article 304
Hauptverfasser:	Johnson, Keith J.C., Krishnan, Rahul, Reps, Thomas, D’Antoni, Loris
Format:	Artikel
Sprache:	eng
Schlagworte:	Abstraction Automatic programming Program semantics Software and its engineering Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!