A race condition graph for concurrent program behavior

Yan Chen; Yann-Hang Lee; W. Eric Wong; Donghui Guo

doi:10.1109/ISKE.2008.4731013

A race condition graph for concurrent program behavior

Yan Chen, Yann-Hang Lee, W. Eric Wong, Donghui Guo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Scopus citations

Abstract

There are race conditions in concurrent programs if the accesses to a sharing resource are not properly synchronized. Because the races can cause the program to behave in unexpected ways, detecting them is an important aspect of debugging and program verification. Many approaches have been used to detect race conditions, but there still is no effective formal model to visualize the race conditions and program interactions. In this paper, we present a formal graph, named Race Condition Graph (RCG), to represent race conditions in concurrent programs. Some characteristics of RCG are presented and the potential RCG (PRCG) as well as the data structure is discussed. Finally, a dining philosopher program is used as a case study.

Original language	English (US)
Title of host publication	Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008
Pages	662-667
Number of pages	6
DOIs	https://doi.org/10.1109/ISKE.2008.4731013
State	Published - 2008
Event	Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008 - Xiamen, China Duration: Nov 17 2008 → Nov 19 2008

Publication series

Name	Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008

Other

Other	Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008
Country/Territory	China
City	Xiamen
Period	11/17/08 → 11/19/08

ASJC Scopus subject areas

Hardware and Architecture
Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/ISKE.2008.4731013

Cite this

Chen, Y., Lee, Y-H., Wong, W. E., & Guo, D. (2008). A race condition graph for concurrent program behavior. In Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008 (pp. 662-667). [4731013] (Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008). https://doi.org/10.1109/ISKE.2008.4731013

A race condition graph for concurrent program behavior. / Chen, Yan; Lee, Yann-Hang; Wong, W. Eric; Guo, Donghui.

Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008. 2008. p. 662-667 4731013 (Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chen, Y, Lee, Y-H, Wong, WE & Guo, D 2008, A race condition graph for concurrent program behavior. in Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008., 4731013, Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008, pp. 662-667, Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008, Xiamen, China, 11/17/08. https://doi.org/10.1109/ISKE.2008.4731013

Chen Y, Lee Y-H, Wong WE, Guo D. A race condition graph for concurrent program behavior. In Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008. 2008. p. 662-667. 4731013. (Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008). https://doi.org/10.1109/ISKE.2008.4731013

@inproceedings{eef0fe6fe3ef4c499fb1677b5b29a415,

title = "A race condition graph for concurrent program behavior",

abstract = "There are race conditions in concurrent programs if the accesses to a sharing resource are not properly synchronized. Because the races can cause the program to behave in unexpected ways, detecting them is an important aspect of debugging and program verification. Many approaches have been used to detect race conditions, but there still is no effective formal model to visualize the race conditions and program interactions. In this paper, we present a formal graph, named Race Condition Graph (RCG), to represent race conditions in concurrent programs. Some characteristics of RCG are presented and the potential RCG (PRCG) as well as the data structure is discussed. Finally, a dining philosopher program is used as a case study.",

author = "Yan Chen and Yann-Hang Lee and Wong, {W. Eric} and Donghui Guo",

note = "Copyright: Copyright 2009 Elsevier B.V., All rights reserved.; Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008 ; Conference date: 17-11-2008 Through 19-11-2008",

year = "2008",

doi = "10.1109/ISKE.2008.4731013",

language = "English (US)",

isbn = "9781424421978",

series = "Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008",

pages = "662--667",

booktitle = "Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008",

}

TY - GEN

T1 - A race condition graph for concurrent program behavior

AU - Chen, Yan

AU - Lee, Yann-Hang

AU - Wong, W. Eric

AU - Guo, Donghui

PY - 2008

Y1 - 2008

N2 - There are race conditions in concurrent programs if the accesses to a sharing resource are not properly synchronized. Because the races can cause the program to behave in unexpected ways, detecting them is an important aspect of debugging and program verification. Many approaches have been used to detect race conditions, but there still is no effective formal model to visualize the race conditions and program interactions. In this paper, we present a formal graph, named Race Condition Graph (RCG), to represent race conditions in concurrent programs. Some characteristics of RCG are presented and the potential RCG (PRCG) as well as the data structure is discussed. Finally, a dining philosopher program is used as a case study.

AB - There are race conditions in concurrent programs if the accesses to a sharing resource are not properly synchronized. Because the races can cause the program to behave in unexpected ways, detecting them is an important aspect of debugging and program verification. Many approaches have been used to detect race conditions, but there still is no effective formal model to visualize the race conditions and program interactions. In this paper, we present a formal graph, named Race Condition Graph (RCG), to represent race conditions in concurrent programs. Some characteristics of RCG are presented and the potential RCG (PRCG) as well as the data structure is discussed. Finally, a dining philosopher program is used as a case study.

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

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

U2 - 10.1109/ISKE.2008.4731013

DO - 10.1109/ISKE.2008.4731013

M3 - Conference contribution

AN - SCOPUS:60349102686

SN - 9781424421978

T3 - Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008

SP - 662

EP - 667

BT - Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008

T2 - Proceedings of 2008 3rd International Conference on Intelligent System and Knowledge Engineering, ISKE 2008

Y2 - 17 November 2008 through 19 November 2008

ER -

A race condition graph for concurrent program behavior

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this