Scaling enumerative program synthesis via divide and conquer

DOI10.1007/978-3-662-54577-5_18MaRDI QIDQ3303902zbMATH OpenOpenAlexFDO

Authors Arjun Radhakrishna, Abhishek Udupa, Rajeev Alur

Publication date 5 August 2020

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-54577-5_18

zbMATH Keywords

decision treesynthesis problemconditional expressioninput pointsemantic constraint

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Syntax-guided synthesis with quantitative syntactic objectives
• Counterexample-guided quantifier instantiation for synthesis in SMT
• Counterexample guided inductive synthesis modulo theories
• From program verification to program synthesis
• Refutation-based synthesis in SMT

Cites work

• Automating string processing in spreadsheets using input-output examples
• Compositional Synthesis of Piece-Wise Functions by Learning Classifiers
• Counterexample-guided quantifier instantiation for synthesis in SMT
• Pattern recognition and machine learning.

Cited in

(16)

• Iterative genetic improvement: scaling stochastic program synthesis
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
• Synthesising programs with non-trivial constants
• Overfitting in synthesis: theory and practice
• A `division' transformation for program and data structures and the structure clash problem
• Programmable program synthesis
• Defining behaviorizeable relations to enable inference in semi-automatic program synthesis
• Experiments on infinite model finding in SMT solving
• Satisfiability and synthesis modulo oracles
• Program synthesis with best-first bottom-up search
• Solving quantified linear arithmetic by counterexample-guided instantiation
• \textsc{SplitRegex}: efficient regex synthesis by neural example splitting
• Automatic discovery of interpretable planning strategies
• Programming by predicates: a formal model for interactive synthesis
• Neural network-guided synthesis of recursive list functions
• Scalable algorithms for abduction via enumerative syntax-guided synthesis

Describes a project that uses

Uses Software

• PRMLT
• FlashMeta
• StarExec

This page was built for publication: Scaling enumerative program synthesis via divide and conquer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303902)