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

More Information
Summary: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.
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.2013.63