2007: Swarat
Chaudhuri: Logics and Algorithms for Software Model Checking
Citation
"The thesis
explores a formalism called nested trees, that can represent complex
branching behavior (loops and recursion) and support modular statement of
context-sensitive correctness conditions. It further makes a specific
technical contribution by offering the first algorithm for reachability in
in nested trees that is sub-cubic in performance. The committee believes
this work has great potential for long-term utility."
2006:
Xiangyu Zhang:
Fault Location via Dynamic Slicing
Citation
"Dynamic slicing is
a technique for determining which variables and data structures affected
values causing a fault (bug) at a particular location in a particular run of
a program, thus allowing a programmer to work backwards to determine the
ultimate cause of a fault. Previously this approach was too expensive to use
in practice. Zhang has improved the performance by orders of magnitude,
making it practical. The committee believes this work will have considerable
impact and value in practice."
2005: Sumit Gulwani:
Program Analysis using Random Interpretation
2003: Godmar Back: Isolation,
Resource Management and Sharing in the KaffeOS Java Runtime System
2002: Michael Hicks: Dynamic
Software Updating
2001: Rastislav Bodik:Path-Sensitive
Value-Flow Optimizations of Programs
