KISS: Keep it simple and sequential

Shaz Qadeer, Dinghao Wu

Research output: Contribution to journalArticle

31 Citations (Scopus)

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)
Pages (from-to)14-24
Number of pages11
JournalACM SIGPLAN Notices
Volume39
Issue number6
StatePublished - Jun 1 2004

Fingerprint

Hazards and race conditions
Model checking
Computational complexity
Semantics

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

Qadeer, Shaz ; Wu, Dinghao. / KISS : Keep it simple and sequential. In: ACM SIGPLAN Notices. 2004 ; Vol. 39, No. 6. pp. 14-24.
@article{75a7ade97a074a4b891e5fcf983dfc81,
title = "KISS: Keep it simple and sequential",
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.",
author = "Shaz Qadeer and Dinghao Wu",
year = "2004",
month = "6",
day = "1",
language = "English (US)",
volume = "39",
pages = "14--24",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "6",

}

Qadeer, S & Wu, D 2004, 'KISS: Keep it simple and sequential', ACM SIGPLAN Notices, vol. 39, no. 6, pp. 14-24.

KISS : Keep it simple and sequential. / Qadeer, Shaz; Wu, Dinghao.

In: ACM SIGPLAN Notices, Vol. 39, No. 6, 01.06.2004, p. 14-24.

Research output: Contribution to journalArticle

TY - JOUR

T1 - KISS

T2 - Keep it simple and sequential

AU - Qadeer, Shaz

AU - Wu, Dinghao

PY - 2004/6/1

Y1 - 2004/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=4544338964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544338964&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4544338964

VL - 39

SP - 14

EP - 24

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 6

ER -