CSE Seminar or Event|
Precise and Fully-Automatic Verification of Container-Manipulating Programs
Thomas DilligAssistant Professor
College of William & Mary
Monday, March 25, 2013|
4:00pm - 5:00pm
Add to Google Calendar
About the Event
One of the key challenges in automated software verification is obtaining a conservative yet sufficiently precise understanding of the contents of data structures in the heap. A particularly important and widely-used class of heap data structures is containers, which support operations such as inserting, retrieving, removing, and iterating over elements. Examples of containers include arrays, lists, vectors, sets, maps, stacks, queues, etc.
Thomas Dillig is an assistant professor at the College of William & Mary. He obtained a PhD in computer science from Stanford University in 2012. The goal of Tom's research is to make programs more reliable through static reasoning. Specifically, Tom is interested in developing precise static analysis techniques that work on real programs. Tom is also interested in constraint solving and simplification techniques and applying them to program analysis problems.
Contact: Cindy Estell
Open to: Public