KISS: Keep it simple and sequential

Shaz Qadeer, Dinghao Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

172 Scopus citations

Abstract

The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent programs, such as model checking, explore all possible thread interleavings. Since the number of thread interleavings increases exponentially with the number of threads, such analyses have high computational complexity. In this paper, we present a novel analysis technique for concurrent programs that avoids this exponential complexity. Our analysis transforms a concurrent program into a sequential program that simulates the execution of a large subset of the behaviors of the concurrent program. The sequential program is then analyzed by a tool that only needs to understand the semantics of sequential execution. Our technique never reports false errors but may miss errors. We have implemented the technique in KISS, an automated checker for multithreaded C programs, and obtained promising initial results by using KISS to detect race conditions in Windows device drivers.

Original languageEnglish (US)
Title of host publicationProceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementaion (PLD'04)
PublisherAssociation for Computing Machinery
Pages14-24
Number of pages11
Volume1
StatePublished - 2004
EventProceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'04) - Washington, DC, United States
Duration: Jun 9 2004Jun 11 2004

Other

OtherProceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'04)
CountryUnited States
CityWashington, DC
Period6/9/046/11/04

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'KISS: Keep it simple and sequential'. Together they form a unique fingerprint.

Cite this