Programmable program synthesis
From MaRDI portal
Publication:832155
DOI10.1007/978-3-030-81685-8_4zbMATH Open1493.68052OpenAlexW3186343449MaRDI QIDQ832155FDOQ832155
Authors: Loris D'Antoni, Qinheping Hu, Jinwoo Kim, Thomas Reps 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81685-8_4
Recommendations
Cites Work
- Title not available (Why is that?)
- SMT-based model checking for recursive programs
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Scaling enumerative program synthesis via divide and conquer
- Syntax-guided synthesis with quantitative syntactic objectives
- Synthesis with asymptotic resource bounds
Cited In (21)
- Synthesis of the programmed functions offor loops on data structures
- Toward neural-network-guided program synthesis and verification
- Self-generating program specializers
- Optimizing synthesis with metasketches
- Learning abstractions for program synthesis
- Title not available (Why is that?)
- Bootstrapping library-based synthesis
- Concise read-only specifications for better synthesis of programs with pointers
- Title not available (Why is that?)
- Program synthesis using dual interpretation
- Title not available (Why is that?)
- Efficient synthesis with probabilistic constraints
- Title not available (Why is that?)
- Program boosting: program synthesis via crowd-sourcing
- Using program synthesis for program analysis
- Program synthesis using realizability
- Title not available (Why is that?)
- Abstraction-based interaction model for synthesis
- Program synthesis for interactive-security systems
- Preface for the SYNT
- Title not available (Why is that?)
Uses Software
This page was built for publication: Programmable program synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832155)
