Paper Info
Title
Forcing small models of conditions on program interleaving for detection of concurrent bugs
Abstract
Is it possible to efficiently reveal concurrency bugs by forcing a well selected set of conditions on program interleaving? To study this general question, we defined two simple models of conditions on program interleaving targeted at the insufficient-synchronization-scope bug pattern. We analyzed these models with respect to several buggy programs. We also implemented an algorithm that tries to force one of these models. The analysis of these models shows that relatively small models can detect insufficient-synchronization-scope bugs. The experiments with the forcing algorithm demonstrated the ability of finding the bug with high efficiency: the average testing time till the bug is detected was improved by factors of 7 and 73 compared with the average time required by a dynamic exploration that did not incorporate the forcing algorithm.
Year
DOI
Venue
2009
10.1145/1639622.1639629
PADTAD
Keywords
Field
DocType
insufficient-synchronization-scope bug pattern,small model,insufficient-synchronization-scope bug,concurrency bug,models shows,average time,average testing time,concurrent bug,buggy program,general question,dynamic exploration,program interleaving,analysis
Concurrency,Computer science,Real-time computing,Forcing (mathematics),Interleaving
Conference
Citations 
PageRank 
References 
10
0.56
19
Authors
6
Name
Order
Citations
PageRank
Ehud Trainin1100.56
Yarden Nir-Buchbinder2664.33
Rachel Tzoref-Brill314912.01
Aviad Zlotnick4706.87
Shmuel Ur5885101.32
Eitan Farchi659046.38