loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
Heuristics for Finding Concurrent Bugs
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
ASCII Text
x 
 
Yosi Ben-Asher, Eitan Farchi, Yaniv Eytani, "Heuristics for Finding Concurrent Bugs," Parallel and Distributed Processing Symposium, International, pp. 288a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2003.1213514,
author = {Yosi Ben-Asher and Eitan Farchi and Yaniv Eytani},
title = {Heuristics for Finding Concurrent Bugs},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {0},
year = {2003},
issn = {1530-2075},
pages = {288a},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213514},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - Heuristics for Finding Concurrent Bugs
SN - 1530-2075
SP
EP
A1 - Yosi Ben-Asher,
A1 - Eitan Farchi,
A1 - Yaniv Eytani,
PY - 2003
KW - null
VL - 0
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Yosi Ben-Asher, Haifa University
Eitan Farchi, IBM Haifa Research Laboratory
Yaniv Eytani, Haifa University
This paper presents new heuristics that increase the probability of manifesting concurrent bugs. The heuristics are based on cross-run monitoring. A contended shared variable is chosen and random context switching is performed at accesses to that variable. The relative strength of the new heuristics is analyzed. In comparison to previous works, our heuristics increase the frequency of bug manifestation. In addition, the new heuristics were able to find bugs that previous methods did not discover.
Citation:
Yosi Ben-Asher, Eitan Farchi, Yaniv Eytani, "Heuristics for Finding Concurrent Bugs," ipdps, pp.288a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.