"Systematic Testing of Concurrent Programs with CHESS"
(Vortrag im Rahmen
der "Distinguished Lecture Series Spring 2008"
des Max Planck Instituts für Software-Systeme)
In this talk, I'll present work by Madan Musuvathi and Shaz Qadeer of my group on radically
improving how we test multi-threaded concurrent programs. Using ideas from direct model
checking of executables, they have created an automated tool called CHESS that
systematically explores the thread schedules of a concurrent program. CHESS incorporates
several novel algorithms including iterative context bounding, which prioritizes the search to
schedules with fewer context switches first, and fair stateless model checking, which
guarantees that the tool will correctly handle programs that depend on fair scheduling to
terminate and will find all livelocks in finite state programs. I will demonstrate a version of
CHESS I have created for .NET programs and talk about our vision for making debugging of
concurrent programs a first-class activity supported by all levels of the software stack. For more
information about CHESS, see http://research.microsoft.com/projects/chess/.
||Freitag, 11. April 2008, 16:00 Uhr
||Saarbrücken, Gebäude MPI-SWS, Raum 019
||Der Vortrag wird live an die TU Kaiserslautern
Gebäude 57 (Rotunde) übertragen.