Speaker:	Chang-Seo Park , UC Berkeley
When:	2008-12-30 14:00
Place:	Room 308, Bldg 302, SNU

Abstract

In the multi-core era, writing concurrent programs have become much more relevant even outside of the high performance and scientific computing communities. Writing correct concurrent programs is hard because it must be correct not only for all inputs, but also for all possible schedules. Existing verification techniques such as model checking is known not to scale, since the number of schedules grow exponentially in the length of execution. I will be talking about our approach to this problem, called active testing, which tests for possibly buggy schedules by actively controlling the scheduler at runtime. So far, the scheduler has been biased to test for schedules exhibiting data races, atomicity violations, and deadlocks. We have uncovered numerous bugs in various programs and libraries with this approach. If time permits, I will also be talking about future extensions of this work which allows the programmer to specify the schedules he wishes to test.

Short bio

Chang-Seo Park is currently a PhD student at University of California, Berkeley (advisor: Koushik Sen). He received his B.S. from Seoul National University in 2005, and his M.S. from Stanford University in 2007. Within the ParLab, a collaborative research center for parallel hardware and software, he is in the Correctness group with research interests in static/dynamic analysis and testing/verification for concurrent programs.

Resources

• talk slide