Please use this identifier to cite or link to this item:

Title: Symbolic Consistency Checking of OpenMP Parallel Programs
Authors: 郁方
Contributors: 資管系
Keywords: symbolic simulation;OpenMP;data race;consistency
Date: 2012.05
Issue Date: 2013-12-26 17:12:37 (UTC+8)
Abstract: We present a symbolic approach for checking consistency of OpenMP parallel programs. A parallel program is consistent if it yields the same result as its sequential version despite the execution order among threads. We find race conditions of an OpenMP parallel program, construct the formal model of its raced segments under relaxed memory models, and perform guided symbolic simulation to search consistency violations. The simulation terminates when (1) a witness has been found (the program is inconsistent), or (2) all reachable states have been explored (the program is consistent). We have developed the tool Pathg by incorporating Omega library to solve race constraints and Red symbolic simulator to perform guided search. We show that Pathg can prove consistency of programs, identify races that modern OpenMP checkers failed to report, and find inconsistency witnesses effectively against benchmarks from the OpenMP Source Code Repository and the NAS Parallel benchmark suite.
Relation: ACM SIGPLAN Notices, 47(5), 139-148
Data Type: article
ISBN: 10.1145/2248418.2248438
DOI 連結:
Appears in Collections:[資訊管理學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing