Program synthesis using deduction-guided reinforcement learning

DOI10.1007/978-3-030-53291-8_30MaRDI QIDQ2226760zbMATH OpenOpenAlexFDO

Authors Yanju Chen, Chenglong Wang, Osbert Bastani, Isil Dillig, Yu Feng

Publication date 9 February 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-53291-8_30

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Counterexample guided inductive synthesis modulo theories
• Synthesizing imperative programs from examples guided by static analysis
• Program synthesis with equivalence reduction
• Learning abstractions for program synthesis
• From program verification to program synthesis

Cited in

(4)

• Defining behaviorizeable relations to enable inference in semi-automatic program synthesis
• Reinforcement learning for Golog programs with first-order state-abstraction
• Iterative genetic improvement: scaling stochastic program synthesis
• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)

This page was built for publication: Program synthesis using deduction-guided reinforcement learning

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