Complete completion using types and weights
Developing modern software typically involves composing functionality from existing
libraries. This task is difficult because libraries may expose many methods to the developer …
libraries. This task is difficult because libraries may expose many methods to the developer …
Synthesis modulo recursive functions
We describe techniques for synthesis and verification of recursive functional programs over
unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo …
unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo …
Programming with enumerable sets of structures
We present an efficient, modular, and feature-rich framework for automated generation and
validation of complex structures, suitable for tasks that explore a large space of structured …
validation of complex structures, suitable for tasks that explore a large space of structured …
Scife: Scala framework for efficient enumeration of data structures with invariants
We introduce SciFe, a tool for automated generation of complex structures, suitable for tasks
such as automated testing and synthesis. SciFe is capable of exhaustive, memoized …
such as automated testing and synthesis. SciFe is capable of exhaustive, memoized …
On integrating deductive synthesis and verification systems
We describe techniques for synthesis and verification of recursive functional programs over
unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo …
unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo …
Search Techniques for Code Generation
T Gvero - 2015 - infoscience.epfl.ch
This dissertation explores techniques that synthesize and generate program fragments and
test inputs. The main goal of these techniques is to improve and support automation in …
test inputs. The main goal of these techniques is to improve and support automation in …