Efficient data race detection for async-finish parallelism

A major productivity hurdle for parallel programming is the presence of data races . Data races can lead to all kinds of harmful program behaviors, including determinism violations and corrupted memory. However, runtime overheads of current dynamic data race detectors are still prohibitively large (...

Full description

Saved in:
Bibliographic Details
Published in:Formal methods in system design Vol. 41; no. 3; pp. 321 - 347
Main Authors: Raman, Raghavan, Zhao, Jisheng, Sarkar, Vivek, Vechev, Martin, Yahav, Eran
Format: Journal Article
Language:English
Published: Boston Springer US 01.12.2012
Subjects:
CAE) and Design
Circuits and Systems
Computer-Aided Engineering (CAD
Electrical Engineering
Engineering
Software Engineering/Programming and Operating Systems
Data races
Determinism
Parallel programming
Program analysis
ISSN:0925-9856, 1572-8102
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A major productivity hurdle for parallel programming is the presence of data races . Data races can lead to all kinds of harmful program behaviors, including determinism violations and corrupted memory. However, runtime overheads of current dynamic data race detectors are still prohibitively large (often incurring slowdowns of 10× or more) for use in mainstream software development. In this paper, we present an efficient dynamic race detection algorithm that handles both the async-finish task-parallel programming model used in languages such as X10 and Habanero Java (HJ) and the spawn-sync constructs used in Cilk. We have implemented our algorithm in a tool called TaskChecker and evaluated it on a suite of 12 benchmarks. To reduce overhead of the dynamic analysis, we have also implemented various static optimizations in the tool. Our experimental results indicate that our approach performs well in practice, incurring an average slowdown of 3.05× compared to a serial execution in the optimized case.
AbstractList A major productivity hurdle for parallel programming is the presence of data races . Data races can lead to all kinds of harmful program behaviors, including determinism violations and corrupted memory. However, runtime overheads of current dynamic data race detectors are still prohibitively large (often incurring slowdowns of 10× or more) for use in mainstream software development. In this paper, we present an efficient dynamic race detection algorithm that handles both the async-finish task-parallel programming model used in languages such as X10 and Habanero Java (HJ) and the spawn-sync constructs used in Cilk. We have implemented our algorithm in a tool called TaskChecker and evaluated it on a suite of 12 benchmarks. To reduce overhead of the dynamic analysis, we have also implemented various static optimizations in the tool. Our experimental results indicate that our approach performs well in practice, incurring an average slowdown of 3.05× compared to a serial execution in the optimized case.
Author Zhao, Jisheng
Vechev, Martin
Raman, Raghavan
Sarkar, Vivek
Yahav, Eran
Author_xml – sequence: 1
  givenname: Raghavan
  surname: Raman
  fullname: Raman, Raghavan
  email: raghav@rice.edu
  organization: Rice University
– sequence: 2
  givenname: Jisheng
  surname: Zhao
  fullname: Zhao, Jisheng
  organization: Rice University
– sequence: 3
  givenname: Vivek
  surname: Sarkar
  fullname: Sarkar, Vivek
  organization: Rice University
– sequence: 4
  givenname: Martin
  surname: Vechev
  fullname: Vechev, Martin
  organization: UNG H 14, ETH Zürich
– sequence: 5
  givenname: Eran
  surname: Yahav
  fullname: Yahav, Eran
  organization: Technion–Israel Institute of Technology
BookMark eNp9z81OAjEQwPHGYCKgD-BtX6A6bem2eDMExYTEi56b2X5oydIlbT3w9i7BkwcOkzn9Z_KbkUkakifknsEDA1CPhYECQYHxcRaCqisyZVJxqhnwCZnCkku61LK9IbNSdgCgWSum5GkdQrTRp9o4rNhktL5xvnpb45CaMOQGyzFZGmKK5bs5YMa-930s-1tyHbAv_u5vz8nny_pjtaHb99e31fOWWq51pVYLz51Q1oKwuAitt54vBMcgueig60AK3emWBeVQYkDJnWqdB9UulWMo5oSd79o8lJJ9MIcc95iPhoE54c0Zb0a8OeGNGhv1r7Gx4olUM8b-YsnPZRm_pC-fzW74yWkEXoh-AUCpcHI
CitedBy_id crossref_primary_10_1145_2666356_2594335
crossref_primary_10_1145_3729265
crossref_primary_10_1155_2015_205827
crossref_primary_10_1007_s11334_019_00343_5
crossref_primary_10_1145_3143359
Cites_doi 10.1145/321879.321884
10.1145/1542476.1542490
10.1145/277651.277696
10.1007/978-3-642-16612-9_8
10.1145/1094811.1094852
10.1145/174266.171370
10.1145/1640089.1640106
10.1007/978-3-642-00590-9_28
10.1145/337449.337465
10.1145/324133.324234
10.1109/MC.2006.180
10.1145/209936.209958
10.1145/1248377.1248416
10.1145/1693453.1693459
10.1145/1639950.1639989
10.1137/1.9781611970265
10.1145/1869459.1869483
10.1145/258492.258493
10.1007/978-1-4757-3472-0_2
10.1145/1229428.1229471
10.1145/277650.277725
ContentType Journal Article
Copyright Springer Science+Business Media, LLC 2012
Copyright_xml – notice: Springer Science+Business Media, LLC 2012
DBID AAYXX
CITATION
DOI 10.1007/s10703-012-0143-7
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1572-8102
EndPage 347
ExternalDocumentID 10_1007_s10703_012_0143_7
GroupedDBID --Z
-5B
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29H
29~
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDPE
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARCEE
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9P
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SCV
SDH
SDM
SEG
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7R
Z7X
Z83
Z88
Z8M
Z8R
Z8W
Z92
ZMTXR
_50
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
ID FETCH-LOGICAL-c288t-c83e2d37cc03ca4f6ece2432af523b0bb0538b861f7da5afa52d76de07697d1a3
IEDL.DBID RSV
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000312325300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-9856
IngestDate Tue Nov 18 21:09:20 EST 2025
Sat Nov 29 02:56:22 EST 2025
Fri Feb 21 02:35:24 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Data races
Determinism
Parallel programming
Program analysis
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c288t-c83e2d37cc03ca4f6ece2432af523b0bb0538b861f7da5afa52d76de07697d1a3
PageCount 27
ParticipantIDs crossref_primary_10_1007_s10703_012_0143_7
crossref_citationtrail_10_1007_s10703_012_0143_7
springer_journals_10_1007_s10703_012_0143_7
PublicationCentury 2000
PublicationDate 20121200
2012-12-00
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 20121200
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
PublicationSubtitle An International Journal
PublicationTitle Formal methods in system design
PublicationTitleAbbrev Form Methods Syst Des
PublicationYear 2012
Publisher Springer US
Publisher_xml – name: Springer US
References Lee, Palsberg (CR19) 2010
Bocchino, Adve, Adve, Snir (CR6) 2009
Frigo, Leiserson, Randall (CR13) 1998
Feng, Leiserson (CR11) 1997
CR15
Tarjan (CR25) 1983
CR10
Mellor-Crummey (CR21) 1993
Barik, Budimlic, Cave, Chatterjee, Guo, Peixotto, Raman, Shirako, Tasirlar, Yan, Zhao, Sarkar (CR3) 2009
Agarwal, Barik, Sarkar, Shyamasundar (CR2) 2007
Bodden, Lam, Hendren (CR7) 2010
Vallée-Rai (CR26) 1999
Guo, Barik, Raman, Sarkar (CR14) 2009
Sadowski, Freund, Flanagan (CR23) 2009
Zhao, Sarkar (CR27) 2011
Blumofe, Joerg, Kuszmaul, Leiserson, Randall, Zhou (CR4) 1995
Lea (CR17) 2000
Leijen, Schulte, Burckhardt (CR20) 2009
Charles, Grothoff, Saraswat, Donawa, Kielstra, Ebcioglu, von Praun, Sarkar (CR8) 2005
Blumofe, Leiserson (CR5) 1999; 46
Larus, Rajwar (CR16) 2006
Agarwal, Barik, Bonachea, Sarkar, Shyamasundar, Yelick (CR1) 2007
Cheng, Feng, Leiserson, Randall, Stark (CR9) 1998
Flanagan, Freund (CR12) 2009
Purandare, Dwyer, Elbaum (CR22) 2010
Tarjan (CR24) 1975; 22
Lee (CR18) 2006; 39
R Bocchino (143_CR6) 2009
RE Tarjan (143_CR24) 1975; 22
143_CR10
J Mellor-Crummey (143_CR21) 1993
RD Blumofe (143_CR5) 1999; 46
JK Lee (143_CR19) 2010
D Lea (143_CR17) 2000
D Leijen (143_CR20) 2009
S Agarwal (143_CR2) 2007
E Bodden (143_CR7) 2010
R Barik (143_CR3) 2009
EA Lee (143_CR18) 2006; 39
C Sadowski (143_CR23) 2009
M Feng (143_CR11) 1997
C Flanagan (143_CR12) 2009
RE Tarjan (143_CR25) 1983
Y Guo (143_CR14) 2009
RD Blumofe (143_CR4) 1995
R Vallée-Rai (143_CR26) 1999
JR Larus (143_CR16) 2006
G-I Cheng (143_CR9) 1998
P Charles (143_CR8) 2005
R Purandare (143_CR22) 2010
143_CR15
J Zhao (143_CR27) 2011
S Agarwal (143_CR1) 2007
M Frigo (143_CR13) 1998
References_xml – volume: 22
  start-page: 215
  year: 1975
  end-page: 225
  ident: CR24
  article-title: Efficiency of a good but not linear set union algorithm
  publication-title: J ACM
  doi: 10.1145/321879.321884
– start-page: 121
  year: 2009
  end-page: 133
  ident: CR12
  article-title: Fasttrack: efficient and precise dynamic race detection
  publication-title: PLDI ’09: proceedings of the 2009 ACM SIGPLAN conference on programming language design and implementation
  doi: 10.1145/1542476.1542490
– year: 2006
  ident: CR16
  publication-title: Transactional memory
– start-page: 183
  year: 2007
  end-page: 193
  ident: CR2
  article-title: May-happen-in-parallel analysis of ×10 programs
  publication-title: PPoPP ’07: Proceedings of the 12th symposium on principles and practice of parallel programming
– start-page: 298
  year: 1998
  end-page: 309
  ident: CR9
  article-title: Detecting data races in Cilk programs that use locks
  publication-title: Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures (SPAA ’98)
  doi: 10.1145/277651.277696
– start-page: 1
  year: 2009
  end-page: 12
  ident: CR14
  article-title: Work-first and help-first scheduling policies for async-finish task parallelism
  publication-title: IPDPS ’09: proceedings of the international symposium on parallel&distributed processing
– start-page: 74
  year: 2010
  end-page: 88
  ident: CR7
  article-title: Clara: a framework for statically evaluating finite-state runtime monitors
  publication-title: 1st international conference on runtime verification (RV)
  doi: 10.1007/978-3-642-16612-9_8
– ident: CR10
– start-page: 519
  year: 2005
  end-page: 538
  ident: CR8
  article-title: X10: an object-oriented approach to non-uniform cluster computing
  publication-title: Proceedings of the twentieth annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, OOPSLA
  doi: 10.1145/1094811.1094852
– start-page: 129
  year: 1993
  end-page: 139
  ident: CR21
  article-title: Compile-time support for efficient data race detection in shared-memory parallel programs
  publication-title: PADD ’93: proceedings of the 1993 ACM/ONR workshop on parallel and distributed debugging
  doi: 10.1145/174266.171370
– start-page: 227
  year: 2009
  end-page: 242
  ident: CR20
  article-title: The design of a task parallel library
  publication-title: OOPSLA ’09: proceeding of the 24th ACM SIGPLAN conference on object oriented programming systems languages and applications
  doi: 10.1145/1640089.1640106
– start-page: 394
  year: 2009
  end-page: 409
  ident: CR23
  article-title: SingleTrack: A dynamic determinism checker for multithreaded programs
  publication-title: Programming languages and systems
  doi: 10.1007/978-3-642-00590-9_28
– start-page: 36
  year: 2000
  end-page: 43
  ident: CR17
  article-title: A java fork/join framework
  publication-title: JAVA ’00: proceedings of the ACM 2000 conference on Java Grande
  doi: 10.1145/337449.337465
– volume: 46
  start-page: 720
  issue: 5
  year: 1999
  end-page: 748
  ident: CR5
  article-title: Scheduling multithreaded computations by work stealing
  publication-title: J ACM
  doi: 10.1145/324133.324234
– volume: 39
  start-page: 33
  issue: 5
  year: 2006
  end-page: 42
  ident: CR18
  article-title: The problem with threads
  publication-title: Computer
  doi: 10.1109/MC.2006.180
– start-page: 207
  year: 1995
  end-page: 216
  ident: CR4
  article-title: Cilk: an efficient multithreaded runtime system
  publication-title: Proceedings of the fifth ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP
  doi: 10.1145/209936.209958
– start-page: 125
  year: 1999
  end-page: 135
  ident: CR26
  article-title: Soot—a Java optimization framework
  publication-title: Proceedings of CASCON 1999
– start-page: 229
  year: 2007
  end-page: 240
  ident: CR1
  article-title: Deadlock-free scheduling of X10 computations with bounded resources
  publication-title: SPAA ’07: Proceedings of the 19th symposium on parallel algorithms and architectures
  doi: 10.1145/1248377.1248416
– start-page: 212
  year: 1998
  end-page: 223
  ident: CR13
  article-title: The implementation of the Cilk-5 multithreaded language
  publication-title: PLDI’98
– ident: CR15
– start-page: 25
  year: 2010
  end-page: 36
  ident: CR19
  article-title: Featherweight ×10: a core calculus for async-finish parallelism
  publication-title: PPoPP ’10: proceedings of the 15th ACM SIGPLAN symposium on principles and practice of parallel computing
  doi: 10.1145/1693453.1693459
– start-page: 735
  year: 2009
  end-page: 736
  ident: CR3
  article-title: The habanero multicore software research project
  publication-title: OOPSLA ’09: Proceeding of the 24th ACM SIGPLAN conference companion on object oriented programming systems languages and applications
  doi: 10.1145/1639950.1639989
– year: 1983
  ident: CR25
  publication-title: Data structures and network algorithms
  doi: 10.1137/1.9781611970265
– start-page: 333
  year: 2011
  end-page: 334
  ident: CR27
  article-title: Intermediate language extensions for parallelism
  publication-title: VMIL’11
– year: 2009
  ident: CR6
  article-title: Parallel programming must be deterministic by default
  publication-title: First USENIX workship on hot topics in parallelism (HOTPAR 2009)
– start-page: 270
  year: 2010
  end-page: 285
  ident: CR22
  article-title: Monitor optimization via stutter-equivalent loop transformation
  publication-title: Proceedings of the ACM international conference on object oriented programming systems languages and applications
  doi: 10.1145/1869459.1869483
– start-page: 1
  year: 1997
  end-page: 11
  ident: CR11
  article-title: Efficient detection of determinacy races in Cilk programs
  publication-title: SPAA ’97: proceedings of the ninth annual ACM symposium on parallel algorithms and architectures
  doi: 10.1145/258492.258493
– start-page: 125
  volume-title: Proceedings of CASCON 1999
  year: 1999
  ident: 143_CR26
– start-page: 394
  volume-title: Programming languages and systems
  year: 2009
  ident: 143_CR23
  doi: 10.1007/978-3-642-00590-9_28
– ident: 143_CR15
– start-page: 1
  volume-title: IPDPS ’09: proceedings of the international symposium on parallel&distributed processing
  year: 2009
  ident: 143_CR14
– start-page: 270
  volume-title: Proceedings of the ACM international conference on object oriented programming systems languages and applications
  year: 2010
  ident: 143_CR22
  doi: 10.1145/1869459.1869483
– start-page: 229
  volume-title: SPAA ’07: Proceedings of the 19th symposium on parallel algorithms and architectures
  year: 2007
  ident: 143_CR1
  doi: 10.1145/1248377.1248416
– start-page: 519
  volume-title: Proceedings of the twentieth annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, OOPSLA
  year: 2005
  ident: 143_CR8
  doi: 10.1145/1094811.1094852
– start-page: 25
  volume-title: PPoPP ’10: proceedings of the 15th ACM SIGPLAN symposium on principles and practice of parallel computing
  year: 2010
  ident: 143_CR19
  doi: 10.1145/1693453.1693459
– start-page: 735
  volume-title: OOPSLA ’09: Proceeding of the 24th ACM SIGPLAN conference companion on object oriented programming systems languages and applications
  year: 2009
  ident: 143_CR3
  doi: 10.1145/1639950.1639989
– start-page: 227
  volume-title: OOPSLA ’09: proceeding of the 24th ACM SIGPLAN conference on object oriented programming systems languages and applications
  year: 2009
  ident: 143_CR20
  doi: 10.1145/1640089.1640106
– ident: 143_CR10
  doi: 10.1007/978-1-4757-3472-0_2
– start-page: 36
  volume-title: JAVA ’00: proceedings of the ACM 2000 conference on Java Grande
  year: 2000
  ident: 143_CR17
  doi: 10.1145/337449.337465
– start-page: 1
  volume-title: SPAA ’97: proceedings of the ninth annual ACM symposium on parallel algorithms and architectures
  year: 1997
  ident: 143_CR11
  doi: 10.1145/258492.258493
– start-page: 129
  volume-title: PADD ’93: proceedings of the 1993 ACM/ONR workshop on parallel and distributed debugging
  year: 1993
  ident: 143_CR21
  doi: 10.1145/174266.171370
– start-page: 183
  volume-title: PPoPP ’07: Proceedings of the 12th symposium on principles and practice of parallel programming
  year: 2007
  ident: 143_CR2
  doi: 10.1145/1229428.1229471
– start-page: 74
  volume-title: 1st international conference on runtime verification (RV)
  year: 2010
  ident: 143_CR7
  doi: 10.1007/978-3-642-16612-9_8
– volume-title: Transactional memory
  year: 2006
  ident: 143_CR16
– volume-title: Data structures and network algorithms
  year: 1983
  ident: 143_CR25
  doi: 10.1137/1.9781611970265
– start-page: 207
  volume-title: Proceedings of the fifth ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP
  year: 1995
  ident: 143_CR4
  doi: 10.1145/209936.209958
– start-page: 298
  volume-title: Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures (SPAA ’98)
  year: 1998
  ident: 143_CR9
  doi: 10.1145/277651.277696
– volume-title: First USENIX workship on hot topics in parallelism (HOTPAR 2009)
  year: 2009
  ident: 143_CR6
– start-page: 212
  volume-title: PLDI’98
  year: 1998
  ident: 143_CR13
  doi: 10.1145/277650.277725
– volume: 39
  start-page: 33
  issue: 5
  year: 2006
  ident: 143_CR18
  publication-title: Computer
  doi: 10.1109/MC.2006.180
– volume: 22
  start-page: 215
  year: 1975
  ident: 143_CR24
  publication-title: J ACM
  doi: 10.1145/321879.321884
– volume: 46
  start-page: 720
  issue: 5
  year: 1999
  ident: 143_CR5
  publication-title: J ACM
  doi: 10.1145/324133.324234
– start-page: 333
  volume-title: VMIL’11
  year: 2011
  ident: 143_CR27
– start-page: 121
  volume-title: PLDI ’09: proceedings of the 2009 ACM SIGPLAN conference on programming language design and implementation
  year: 2009
  ident: 143_CR12
  doi: 10.1145/1542476.1542490
SSID ssj0008163
Score 2.0361538
Snippet A major productivity hurdle for parallel programming is the presence of data races . Data races can lead to all kinds of harmful program behaviors, including...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
StartPage 321
SubjectTerms CAE) and Design
Circuits and Systems
Computer-Aided Engineering (CAD
Electrical Engineering
Engineering
Software Engineering/Programming and Operating Systems
Title Efficient data race detection for async-finish parallelism
URI https://link.springer.com/article/10.1007/s10703-012-0143-7
Volume 41
WOSCitedRecordID wos000312325300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLink Journals
  customDbUrl:
  eissn: 1572-8102
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008163
  issn: 0925-9856
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5aPejBalWsL3LwpAR2k908vIlUPEgRH6W3JU8s1FW6q-C_d5Pu1hZU0PskhEkmM2G-fB8AJxG21IMtEKWOocQIgyQVFBnJY2cjxXBAuw9uWL_Ph0NxW__jLhq0e9OSDDf13Gc3FrA_HkqQEMSWwUqV7bjXa7i7H8yuXx5P5dMETpHgKW1amd9NsZiMFjuhIcFctf-1tE2wUdeT8GJ6ALbAks07oN1oNcA6dDtgfY54cBuc9wJzRJVwoIeIwonUFhpbBlxWDqtCFsriI9fIeeaRJ-gJwsdjOx4Vzzvg8ar3cHmNahUFpDHnJdKcWGwI0zoiWiaOWm1xQrB01RtURUpVYcgVp7FjRqbSyRQbRo2NGBXMxJLsglb-kts9ABlJpOcv1EqJRAkiq5Gaal9lOq5S1QVR485M1xTjXulinH2RI3tPZZWnMu-pjHXB6WzI65Rf4zfjs8b_WR1qxc_W-3-yPgBr2G9g2MND0Conb_YIrOr3clRMjsMR-wTyQslb
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fS8MwED50CuqD06k4f-bBJyXQpm2S-iayoTiH6Bx7K_lVHNQq6xT87226dm6ggr5fQviSy124L98BnDjEUEu2wJTGDPs61FjQkGItuBsbRzJSsN37Hdbt8sEgvCv_cWcV270qSRY39cxnN1ZwfyyVwPcwW4QlPw9YVjD__qE_vX65O2mfFpIAhzygVSnzuynmg9F8JbQIMO36v5a2AetlPokuJgdgExZM2oB61asBla7bgLUZ4cEtOG8VyhF5wEGWIopGQhmkzbjgZaUoT2SRyD5ShWOrPPKErEB4kphkmD1vw2O71bu8wmUXBawI52OsuGeI9phSjqeEH1OjDPE9IuL8DSodKXM35JJTN2ZaBCIWAdGMauMwGjLtCm8HaulLanYBMc8XVr9QSRn6MvREPlJRZbPMmMtANsGp4IxUKTFuO10k0Zc4skUqypGKLFIRa8LpdMjrRF_jN-OzCv-odLXsZ-u9P1kfw8pV77YTda67N_uwSuxmFvt5ALXx6M0cwrJ6Hw-z0VFx3D4BbNPMPw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50FdGD6xPXZw6elGCbtknqTdRFcVkEH3greeJCrcu2Cv57m267Kqgg3idpmMk0E-bL9wHse8RQB7bAlFqGQx1rLGhMsRbct8aTjFRo9_se6_f5w0N8Xeuc5g3avWlJjt80OJamrDgaanv06eEbq3BADlYQBphNw0zocPTuun5zP_kVc38spRaTCMc8ok1b87spvh5MX7ui1WHTbf97mUuwWNeZ6GS8MZZhymQr0G40HFCd0iuw8ImQcBWOzytGifILyEFH0Ugog7QpKrxWhsoCF4n8LVPYOkaSR-SIw9PUpIP8aQ3uuue3pxe4VlfAinBeYMUDQ3TAlPICJUJLjTIkDIiw5d1UelKW6cklp75lWkTCiohoRrXxGI2Z9kWwDq3sOTMbgFgQCsdrqKSMQxkHohypqHLVp-Uykh3wGtcmqqYedwoYafJBmuw8lZSeSpynEtaBg8mQ4Zh34zfjwyYWSZ2C-c_Wm3-y3oO567Nu0rvsX23BPHGxrMK5Da1i9GJ2YFa9FoN8tFvtvHffn9Uj
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+data+race+detection+for+async-finish+parallelism&rft.jtitle=Formal+methods+in+system+design&rft.au=Raman%2C+Raghavan&rft.au=Zhao%2C+Jisheng&rft.au=Sarkar%2C+Vivek&rft.au=Vechev%2C+Martin&rft.date=2012-12-01&rft.pub=Springer+US&rft.issn=0925-9856&rft.eissn=1572-8102&rft.volume=41&rft.issue=3&rft.spage=321&rft.epage=347&rft_id=info:doi/10.1007%2Fs10703-012-0143-7&rft.externalDocID=10_1007_s10703_012_0143_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-9856&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-9856&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-9856&client=summon