The role of automata theory in software verification
P. Madhusudan - University of Illinois at Urbana-Champaign
Oct 27, 2010Size: 451.1MB
Download: MP4 Video
Watch in your Browser Watch on YouTube
AbstractThe 80s and 90s saw a revolution in hardware verification, where automata theory played a prominent role, formalizing model-checking and establishing the basis of verification using the logic-automata connection. We shift focus to software verification and ask how exactly would automata theory be useful in program analysis.
Drawing from work in recent years in software verification in my research group as well as in the field, I will identify several key areas, ranging from modeling, abstraction, model-checking, interface synthesis, testing, to logical reasoning with dynamic data-structures, where automata theory promises to provide the right abstractions and yield effective tools for program analysis.
About the SpeakerMadhusudan worked for his Ph.D. at the Institute of Mathematical Sciences, India, and after a three-year post-doc stint at UPenn, joined the faculty at the Unviersity of Illinois at Urbana-Champaign. His research interests are primarily in the verification and analysis of software, with an emphasis on methods involving concurrency, logic and automata theory.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.