Symbolic Analysis of Concurrency Errors in OpenMP Programs

In this paper we present the OpenMP Analysis Toolkit (OAT), which uses Satisfiability Modulo Theories (SMT) solver based symbolic analysis to detect data races and deadlocks in OpenMP codes. Our approach approximately simulates real executions of an OpenMP program through schedule permutation. We co...

Full description

Saved in:
Bibliographic Details
Published in2013 42nd International Conference on Parallel Processing pp. 510 - 516
Main Authors Hongyi Ma, Diersen, Steve R., Liqiang Wang, Chunhua Liao, Quinlan, Daniel, Zijiang Yang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2013
Subjects
Arrays
Concurrent computing
Data Race
Deadlock
Encoding
Indexes
OpenMP
SMT solver
Symbolic Anslysis
Synchronization
System recovery
Online AccessGet full text

Cover

Abstract In this paper we present the OpenMP Analysis Toolkit (OAT), which uses Satisfiability Modulo Theories (SMT) solver based symbolic analysis to detect data races and deadlocks in OpenMP codes. Our approach approximately simulates real executions of an OpenMP program through schedule permutation. We conducted experiments on real-world OpenMP benchmarks and student homework assignments by comparing our OAT tool with two commercial dynamic analysis tools: Intel Thread Checker and Sun Thread Analyzer, and one commercial static analysis tool: Viva64 PVS Studio. The experiments show that our symbolic analysis approach is more accurate than static analysis and more efficient and scalable than dynamic analysis tools with less false positives and negatives.
AbstractList In this paper we present the OpenMP Analysis Toolkit (OAT), which uses Satisfiability Modulo Theories (SMT) solver based symbolic analysis to detect data races and deadlocks in OpenMP codes. Our approach approximately simulates real executions of an OpenMP program through schedule permutation. We conducted experiments on real-world OpenMP benchmarks and student homework assignments by comparing our OAT tool with two commercial dynamic analysis tools: Intel Thread Checker and Sun Thread Analyzer, and one commercial static analysis tool: Viva64 PVS Studio. The experiments show that our symbolic analysis approach is more accurate than static analysis and more efficient and scalable than dynamic analysis tools with less false positives and negatives.
Author Diersen, Steve R.
Quinlan, Daniel
Chunhua Liao
Liqiang Wang
Zijiang Yang
Hongyi Ma
Author_xml – sequence: 1
  surname: Hongyi Ma
  fullname: Hongyi Ma
  email: hma3@uwyo.edu
– sequence: 2
  givenname: Steve R.
  surname: Diersen
  fullname: Diersen, Steve R.
  email: sdiersen@uwyo.edu
– sequence: 3
  surname: Liqiang Wang
  fullname: Liqiang Wang
  email: lwang7@uwyo.edu
– sequence: 4
  surname: Chunhua Liao
  fullname: Chunhua Liao
  email: liao6@llnl.gov
– sequence: 5
  givenname: Daniel
  surname: Quinlan
  fullname: Quinlan, Daniel
  email: dquinlan@llnl.gov
– sequence: 6
  surname: Zijiang Yang
  fullname: Zijiang Yang
  email: zijiang.yang@wmich.edu
BookMark eNotjEFLwzAYQKNMsJ3evHnJH2j9vnxt03gbZepgsoJ6HmmaSqRNR6KH_nsHCg_e5fFStvKzt4zdIeSIoB52TdvmApDyii5YCrJSZYko6ZIlgkhkZaVgxRJABRkprK9ZGuMXgAAqi4Q9vi1TN4_O8I3X4xJd5PPAm9mbnxCsNwvfhjCHyJ3nh5P1ry1vw_wZ9BRv2NWgx2hv_71mH0_b9-Yl2x-ed81mnzmB9J0Z2RWogaxQkoxGRXWpVC0UkISy69GYusBCa1UIpYu-1j3pAQfSnZDnmNbs_u_rrLXHU3CTDsuxqmpJZ34BkwlIVQ
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICPP.2013.63
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 0769551173
9780769551173
EISSN 2332-5690
EndPage 516
ExternalDocumentID 6687387
Genre orig-research
GroupedDBID -~X
23M
29P
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
ADZIZ
AFFNX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
G8K
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
XOL
ID FETCH-LOGICAL-i213t-c7b41a03e2973ca193859982903705bd1cc8414aa9429a4d8ad3af1f3ab279383
IEDL.DBID RIE
ISSN 0190-3918
IngestDate Wed Jun 26 19:28:24 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i213t-c7b41a03e2973ca193859982903705bd1cc8414aa9429a4d8ad3af1f3ab279383
OpenAccessLink https://www.osti.gov/biblio/1088426
PageCount 7
ParticipantIDs ieee_primary_6687387
PublicationCentury 2000
PublicationDate 2013-Oct.
PublicationDateYYYYMMDD 2013-10-01
PublicationDate_xml – month: 10
  year: 2013
  text: 2013-Oct.
PublicationDecade 2010
PublicationTitle 2013 42nd International Conference on Parallel Processing
PublicationTitleAbbrev icpp
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020354
ssib026763296
Score 2.1054912
Snippet In this paper we present the OpenMP Analysis Toolkit (OAT), which uses Satisfiability Modulo Theories (SMT) solver based symbolic analysis to detect data races...
SourceID ieee
SourceType Publisher
StartPage 510
SubjectTerms Arrays
Concurrent computing
Data Race
Deadlock
Encoding
Indexes
OpenMP
SMT solver
Symbolic Anslysis
Synchronization
System recovery
Title Symbolic Analysis of Concurrency Errors in OpenMP Programs
URI https://ieeexplore.ieee.org/document/6687387
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEA5tT56qtuKbHDy62-wmm028lpYqVBa00FvJE4q4K-32UH-9yT6qiAdvIYcwzGSYmeSbbwC4E0ZxJikOrOVxQBJBA04MDdIoUUIgg5iuALLPdLYgT8tk2QH3h14YY0wFPjOhX1Z_-bpQO_9UNqKUpZilXdBlKK57tdq7E1PnKLGnjmuKLYQT0rZKYx6xA-idjx7HWeZBXTj05J8_hqpUMWXaB_NWmhpK8hbuShmqz19Ejf8V9xgMv7v3YHaISyegY_JT0G_HN8DGmwfg4WX_Lj0tMGyZSWBhoTtEVZxNag8nm02x2cJ1Dj3uZJ75Yz2aazsEi-nkdTwLmlEKwTqOcBmoVJJIIGz8qColXNbGEldoxRzhFCVSR0oxEhEhuItPgmgmNBY2sljI2Hkww2eglxe5OQfQSkos0lxo4ko7SQVLXEpiNNMGYWXsBRh4Vaw-araMVaOFy7-3r8CRt0QNj7sGvXKzMzcuzJfytrLvFx_8pPU
link.rule.ids 310,311,786,790,795,796,802,23958,23959,25170,27958,55109
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LTwIxEG4QD3pCBePbHjy6S3fb7bZeCQQUCImQcCN9JsS4a3gc8NfbLiwa48Fb00PTzHTyddpvvgHgQRjFmaQ4sJbHAUkEDTgxNEijRAmBDGK6IMgOaXdCnqfJtAIe97UwxpiCfGZCPyz-8nWu1v6prEkpSzFLD8Chw3nEt9Va5emJqQuV2IvH7dIthBNSFktjHrE97Z03e63RyNO6cOjlP3-0VSlQpVMDg3I_WzLJW7heyVB9_pJq_O-GT0Dju34PjvbIdAoqJjsDtbKBA9zFcx08vW7epRcGhqU2CcwtdIuoQrVJbWB7scgXSzjPoGeeDEZ-Wc_nWjbApNMet7rBrplCMI8jvApUKkkkEDa-WZUS7t7GEpdqxRzhFCVSR0oxEhEhuEMoQTQTGgsbWSxk7GKY4XNQzfLMXABoJSUWaS40ccmdpIIl7lJiNNMGYWXsJah7U8w-tnoZs50Vrv6evgdH3fGgP-v3hi_X4Nh7ZUuWuwHV1WJtbh3or-Rd4esvCayoSw
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=proceeding&rft.title=2013+42nd+International+Conference+on+Parallel+Processing&rft.atitle=Symbolic+Analysis+of+Concurrency+Errors+in+OpenMP+Programs&rft.au=Hongyi+Ma&rft.au=Diersen%2C+Steve+R.&rft.au=Liqiang+Wang&rft.au=Chunhua+Liao&rft.date=2013-10-01&rft.pub=IEEE&rft.issn=0190-3918&rft.eissn=2332-5690&rft.spage=510&rft.epage=516&rft_id=info:doi/10.1109%2FICPP.2013.63&rft.externalDocID=6687387
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0190-3918&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0190-3918&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0190-3918&client=summon