Scaling Enumerative Program Synthesis via Divide and Conquer

DOI10.1007/978-3-662-54577-5_18zbMath1452.68043OpenAlexW2603456259MaRDI QIDQ3303902

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)

Related Items

Programmable program synthesis, Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper), Satisfiability and synthesis modulo oracles, Solving quantified linear arithmetic by counterexample-guided instantiation, Iterative genetic improvement: scaling stochastic program synthesis, Synthesising programs with non-trivial constants, Defining behaviorizeable relations to enable inference in semi-automatic program synthesis, Programming by predicates: a formal model for interactive synthesis, Automatic discovery of interpretable planning strategies, Scalable algorithms for abduction via enumerative syntax-guided synthesis

Uses Software

• StarExec
• FlashMeta
• PRMLT

Cites Work

• Unnamed Item
• Counterexample-guided quantifier instantiation for synthesis in SMT
• Compositional Synthesis of Piece-Wise Functions by Learning Classifiers
• Automating string processing in spreadsheets using input-output examples