–
Reactive Synthesis
Bernd Finkbeiner (CISPA Helmholtz Center for Information Security)
–
Syntax-Guided Program Synthesis
Rajeev Alur (University of Pennsylvania)
–
Data-Driven Inference of Representation Invariants
Todd Millstein (UCLA)
–
Q&A
–
CounterExample Guided Inductive Synthesis Modulo Theories
Elizabeth Polgreen (University of Edinburgh)
–
Q&A
–
Syntax-Guided Synthesis in SMT: A View from Inside the Solver
Andrew J. Reynolds (University of Iowa)
–
Q&A
–
Neural Network guided Grammar Filtering For Syntax-Guided Synthesis
Mark Santolucito (Barnard College)
–
Q&A
Reactive Synthesis - Current and Future Directions
–
Shield Synthesis for Safe Reinforcement Learning
Roderick Bloem (IAIK)
–
Reconfigurable Interaction for MAS Modeling
Nir Piterman (University of Gothenberg)
–
Control Synthesis and its Magical Futures
Anna Lukina (IST Austria)
–
Synthesizing Approximate Implementations for Reactive Systems
Hazem Torfah (UC Berkeley)
–
Synthesis of Coordination Programs from Linear Temporal Specifications
Suguman Bansal (University of Pennsylvania)
–
Synthesis of Functional Reactive Programs via a Reduction of Asynchronous Inputs to Lists
Julie Newcomb (University of Washington)
–
A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching
Jerry Zhu (University of Wisconsin-Madison)
–
Liquid Time Constant Networks
Ramin Hasani (MIT)
–
Program Synthesis via Deep Learning over Graph Structured Data
Mayur Naik (University of Pennsylvania)
–
Dreamcoder: Bootstrapping Inductive Program Synthesis With Wake-Sleep Library Learning
Kevin Ellis (Cornell)
–
Formal Synthesis: Oracle-guided Learning of Compositional Concepts
Susmit Jha (SRI)
–
On Optimal Collusion-Free Teaching
Sandra Zilles (University of Regina)
–
Towards a Theory of Learning Inductive Invariants
Yotam Feldman (Tel Aviv University)
–
Inferring Specifications From Demonstrations; A Maximum (Causal) Entropy Approach
Marcell Vazquez-Chanlatte (UC Berkeley)
–
Guarantees in Syntax-Guided Synthesis
Loris D'Antoni (University of Wisconsin-Madison)
–
Counterexample-guided Repair in Boolean Functional Synthesis
Supratik Chakraborty (IIT Bombay)
–
Visualization By Example
Chenglong Wang (University of Washington)
–
Counterexample Guided Inference of Modular Specifications
Bill Hallahan (Yale University)
–
Towards the Automated Synthesis of Probabilistic Programs
Joost-Pieter Katoen (RWTH Aachen University)
–
Synthesis of Safe, Small and Optimal Strategies for Cyber-Physical Systems
Kim Larsen (Aalborg University)
–
Automated Verification and Control Synthesis for CPS Models
Alessandro Abate (University of Oxford)
–
Synthesizing Randomized Systems with Algorithmic Improvisation
Daniel Fremont (UC Santa Cruz)
–
Optimization-based Formal Synthesis of Control Strategies for Dynamical Systems
Calin Belta (Boston University)
–
Synthesis for Correctness Is Not Enough: How to Specify, Verify, and Synthesize Robust Systems
Paulo Tabuada (UCLA)
–
Coordination of for Large Collections of Dynamical Systems with Constraint Satisfaction Guarantees
Necmiye Ozay (University of Michigan)
–
Provably Correct Training of Neural Network Controllers
Yasser Shoukry (UC Irvine)
–
Synthesizing Network Configuration Updates
Nate Foster (Cornell)
–
Using Program Synthesis to Build Compilers
Alvin Cheung (UC Berkeley)
–
Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
Chao Wang (University of Southern California)
–
Managing Data Plane Diversity with Control Plane Synthesis
Eric Hayden Campbell (Cornell)
–
Panel Discussion on Challenges and Opportunities in Synthesis
Ezio Bartocci (TU Wien), Sumit Gulwani (Microsoft), Hadas Kress-Gazit (Cornell), Orna Kupferman (Hebrew University), Armando Solar-Lezama (MIT)