Component-based synthesis for complex APIs
DOI10.1145/3009837.3009851zbMATH Open1380.68108OpenAlexW2561055248MaRDI QIDQ5370893FDOQ5370893
Authors: Yu Feng, Ruben Martins, Isil Dillig, Yue-Peng Wang, Thomas Reps 
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3009837.3009851
Recommendations
- Look for the proof to find the program: decorated-component-based program synthesis
- Program synthesis using dual interpretation
- From program verification to program synthesis
- Counterexample guided inductive synthesis modulo theories
- Synthesizing imperative programs from examples guided by static analysis
Theory of compilers and interpreters (68N20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- Synthesising programs with non-trivial constants
- Long-Run Average Behavior of Vector Addition Systems with States
- \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches
- Separators in Continuous Petri Nets
- Title not available (Why is that?)
- Directed reachability for infinite-state systems
- Bootstrapping library-based synthesis
- Separators in continuous Petri nets
- Program synthesis using dual interpretation
- SyPet
- Look for the proof to find the program: decorated-component-based program synthesis
- Programming by predicates: a formal model for interactive synthesis
Uses Software
This page was built for publication: Component-based synthesis for complex APIs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370893)
