IC Colloquium : Modeling Biology with Solver-Aided Programming Languages
Event details
| Date | 27.09.2013 |
| Hour | 15:15 |
| Speaker | Ras Bodik - Professor of Computer Science at University of California, Berkeley |
| Location | |
| Category | Conferences - Seminars |
Bio:
Ras Bodik is a Professor of Computer Science at University of California, Berkeley. He works on a range of techniques for program synthesis, from programming by demonstration, to sketching, and solver-aided languages. His group has applied synthesis to high-performance computing, web browser construction, algorithm design, document layout, and biology. He has designed a course on programming languages where student learn hands-on small-language design by constructing a modern web browser.
Talk:
Modeling Biology with Solver-Aided Programming Languages
A good model of a biological cell exposes secrets of the cell's signaling mechanisms, explaining diseases and facilitating drug discovery. Modeling cells is fundamentally a programming problem --- it's programming because the model is a concurrent program that simulates the cell, and it's a problem because it is hard to write a program that reproduces all experimental observations of the cell faithfully.
In this talk, I will introduce solver-aided programming languages and show how they ease modeling biology as well as make programming accessible to non-programmers. Solver-aided languages come with constructs that delegate part of the programming problem to a constraint solver, which can be guided to synthesize parts of the program, localize its bugs, or act as a clairvoyant oracle.
I will describe our work on synthesis of stem cell models in c. elegans and then show how our framework called Rosette can rapidly implement a solver aided language in several domains, from programming by demonstration to spatial parallel programming.
Joint work with Jasmin Fisher, Ali Sinan Koksal, Nir Piterman, Evan Pu, Saurabh Srivastava, and Emina Torlak.
Ras Bodik is a Professor of Computer Science at University of California, Berkeley. He works on a range of techniques for program synthesis, from programming by demonstration, to sketching, and solver-aided languages. His group has applied synthesis to high-performance computing, web browser construction, algorithm design, document layout, and biology. He has designed a course on programming languages where student learn hands-on small-language design by constructing a modern web browser.
Talk:
Modeling Biology with Solver-Aided Programming Languages
A good model of a biological cell exposes secrets of the cell's signaling mechanisms, explaining diseases and facilitating drug discovery. Modeling cells is fundamentally a programming problem --- it's programming because the model is a concurrent program that simulates the cell, and it's a problem because it is hard to write a program that reproduces all experimental observations of the cell faithfully.
In this talk, I will introduce solver-aided programming languages and show how they ease modeling biology as well as make programming accessible to non-programmers. Solver-aided languages come with constructs that delegate part of the programming problem to a constraint solver, which can be guided to synthesize parts of the program, localize its bugs, or act as a clairvoyant oracle.
I will describe our work on synthesis of stem cell models in c. elegans and then show how our framework called Rosette can rapidly implement a solver aided language in several domains, from programming by demonstration to spatial parallel programming.
Joint work with Jasmin Fisher, Ali Sinan Koksal, Nir Piterman, Evan Pu, Saurabh Srivastava, and Emina Torlak.
Links
Practical information
- General public
- Free
- This event is internal
Contact
- Host : Victor Kuncak