CHESS: Find and Reproduce Heisenbugs in Concurrent Programs

CHESS is a tool for finding and reproducing Heisenbugs in concurrent programs. CHESS repeatedly runs a concurrent test ensuring that every run takes a different interleaving. If an interleaving results in an error, CHESS can reproduce the interleaving for improved debugging. CHESS is available for both managed and native programs.

People

Tom Ball
Research Manager/ Principal Researcher
Sebastian Burckhardt
Senior Researcher
Shaz Qadeer
Principal Researcher
Madan Musuvathi
Principal Researcher
Peli de Halleux
Principal RSDE

2008
- Katherine Coons, University of Texas at Austin
- Alexander Malkis, Freiburg University
- Vasu Singh, EPFL
2007
- Gerard Basler, ETH Zurich
- Tayfun Elmas, Koc University
- Piramanayagam Arumuga Nainar, University of Wisconsin at Madison
2006
- Iulian Neamtiu, University of Maryland at College Park

A number of people are experimenting with CHESS in course projects. The links below point to their project summaries. Thanks to these CHESS players for their work! Let us known if you have something to contribute!

Michael Bentley, Univ. Utah
Carson Jones, Univ. Utah

CHESS open source
CHESS Tutorial at PLDI 2009 [slides: ppt, pdf]
Channel 9 video on CHESS
Read the Dr. Dobb’s Journal article on CHESS, listen to Scott Hanselman’s interview about CHESS at PDC (go to 28:10), watch the video of the CHESS PDC presentation
Mary Jo Foley: Non-Microsoft developers to get a peek at CHESS concurrency test tool
MSDN article on Tools and Techniques to Identify Concurrency Issues

People

Tom Ball

Sebastian Burckhardt

Shaz Qadeer

Madan Musuvathi

Peli de Halleux

Publications

Microsoft Research blog

Interns

CHESS Players

News

Follow Microsoft Research

Share this page