|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Bridging the Discrete and the Continuous in Reasoning about Programs
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.
This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending
Traditionally, reasoning about programs is a boolean problem that is solved using the discrete tools of logic. However, in many emergent applications, discrete reasoning about programs needs to be supplemented by quantitative analysis. This demand opens up a new playground for research: there is now the opportunity to combine the discrete tools of program analysis with continuous tools like numerical optimization, geometric algorithms, and statistical machine learning.
This talk will describe some recent and ongoing work on topic. Specifically, I will talk about smoothed proof search, a new approach to synthesis with respect to boolean and quantitative goals that couples discrete program analysis with continuous numerical optimization. I will also touch upon a few other ongoing projects on this topic in my group, including reasoning about programs under numerical uncertainty, a synthesis approach for robotics that combines SAT -based reasoning with continuous motion planning, and a statistical program analysis used to grade student submissions in a massive open online course.
Bio: Swarat Chaudhuri is an assistant professor of computer science at Rice University. He is an expert on program verification and synthesis. Swarat received a bachelor’s degree in computer science from the Indian Institute of Technology, Kharagpur, in 2001, and a doctoral degree in computer science from the University of Pennsylvania in 2007. He is a recipient of the National Science Foundation CAREER award, the ACM SIGPLAN Outstanding Doctoral Dissertation Award, and the Morris and Dorothy Rubinoff Dissertation Award from the University of Pennsylvania.
This talk is part of the Microsoft Research Cambridge, public talks series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsComputer Laboratory Programming Research Group Seminar talks BHRU Annual Lecture 2014
Other talksWinning the oil lottery: The impact of natural resource extraction on growth Interferometric scattering microscopy: From high-speed nanometry to ultra-sensitive label-free imaging The role of cystine-knot proteins in vertebrate immunity to Staphylococcus aureus Trust and Power in the Art Market: A Machiavellian World?" Fast transient brain states Why fracking works and why not well enough