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

A key challenge in program synthesis is the astronomical size of the search space the synthesizer has to explore. In response to this challenge, recent work proposed to guide synthesis using learned probabilistic models. Obtaining such a model, however, might be infeasible for a problem domain where...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 4; no. OOPSLA; pp. 1 - 29
Main Authors:	Barke, Shraddha, Peleg, Hila, Polikarpova, Nadia
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 13.11.2020
Subjects:	Context specific languages Domain specific languages Programming by example Software and its engineering Software notations and tools Probabilistic models Domain-specific languages Program Synthesis
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!