A synthesis-enabled language that allows programmers to write programs with holes and then rely on constraint-based synthesis to discover the missing code.
People: Armando Solar-Lezama
Deductive synthesis for large-scale implementations of dynamic programming algorithms. Strives to produce cache-oblivious distributed programs using a divide-and-conquer method. Incorporates modern proof techniques with a software refinement paradigm.
People: Shachar Itzhaky
Object Spreadsheets (joint work with SDG) —
Attempts to make data-driven programming more accessible to end-users by imitating the look-and-feel of spreadsheets. The design comprises of a hybrid tabular-hierarchical data model, a query language for writing formulas, and an IDE.
People: Shachar Itzhaky, Matt McCutchen
Cyber-Physical Security — Safety-critical embedded systems are vulnerable to combinations of cyber and physical attacks. Examples include Stuxnet attacks on power grids and GPS spoofing. We use program analysis and synthesis techniques to analyze security vulnerability and develop defense mechanisms. People: Sicun Gao
Control Design Automation —
To design controllers for dynamical systems is to solve a special class of program synthesis problems. We exploit the connection between control theory and formal methods to develop automated methods for hybrid and nonlinear control.
People: Sicun Gao
Have you ever seen an app do something and thought “I want my app to do that too?” DemoMatch gives you a tutorial for doing something with a framework simply by observing another program doing so.
People: Kuat Yessenov, Jimmy Koppel
Synquid stands for SYNthesis from liQUID types. It extends the Liquid Types framework, used successfully in program verification, to the domain of program synthesis, exploiting the combination of types and SMT-decidable predicates to generate provably correct programs in a modular fashion.
People: Nadia Polikarpova
Sigma is a probabilistic programming language. It allows you to specify arbitrarily complex probabilistic models as functional programs, and provides inference procedures to answer questions about the model. Sigma’s inference algorithms combine modern statistical inference methods with abstract interpretation, SAT solving, and non-linear constraint solving.
People: Zenna Tavares
MSL is a synthesis enabled language for writing bulk-synchronous SPMD implementations.
People: Zhilei Xu
3cobblers is an approximate program synthesis framework. Rather than synthesizing a correct program all at once, which can be difficult, it synthesizes a sequence of simpler approximate programs that approaches the correct program.
People: Evan Pu
AutoSMT is a framework for automatically generating domain-specific rewriters for SMT problems. The generated problem rewriters are auto-tuned to performance of a specific solver for problems from a particular domain.
People: Rohit Singh
Rishabh Singh, Microsoft Research
Alvin Cheung, University of Washington