2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness)最新文献

HPC Software Verification in Action: A Case Study with Tensor Transposition HPC软件的验证:一个张量变换的案例研究

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00006

Erdal Mutlu, Ajay Panyala, S. Krishnamoorthy

引用次数: 0

Workshop overview 车间概述

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/correctness.2018.00004

Michael Buckley

引用次数: 0

Verifying Qthreads: Is Model Checking Viable for User Level Tasking Runtimes? 验证qthread:模型检查是否适用于用户级任务运行时?

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00008

N. Evans

引用次数: 2

Using Polyhedral Analysis to Verify OpenMP Applications are Data Race Free 使用多面体分析来验证OpenMP应用程序是无数据竞争的

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00010

Fangke Ye, M. Schordan, C. Liao, Pei-Hung Lin, I. Karlin, Vivek Sarkar

引用次数: 12

Title Page 标题页

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/correctness.2018.00001

引用次数: 0

Correctness of Dynamic Dependence Analysis for Implicitly Parallel Tasking Systems 隐式并行任务系统动态依赖分析的正确性

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00007

Wonchan Lee, George Stelle, P. McCormick, A. Aiken

{"title":"Correctness of Dynamic Dependence Analysis for Implicitly Parallel Tasking Systems","authors":"Wonchan Lee, George Stelle, P. McCormick, A. Aiken","doi":"10.1109/Correctness.2018.00007","DOIUrl":"https://doi.org/10.1109/Correctness.2018.00007","url":null,"abstract":"In this paper, we rigorously verify the correctness of dynamic dependence analysis, a key algorithm for parallelizing programs in implicitly parallel tasking systems. A dynamic dependence analysis of a program results in a task graph, a DAG of tasks constraining the order of task execution. Because a program is automatically parallelized based on its task graph, the analysis algorithm must generate a graph with all the dependencies that are necessary to preserve the program’s original semantics for any non-deterministic parallel execution of tasks. However, this correctness is not straightforward to verify as implicitly parallel tasking systems often use an optimized dependence analysis algorithm. To study the correctness of dynamic dependence analysis in a realistic setting, we design a model algorithm that captures the essence of realistic analysis algorithms. We prove that this algorithm constructs task graphs that soundly and completely express correct parallel executions of programs. We also show that the generated task graph is the most succinct one for a program when the program satisfies certain conditions.","PeriodicalId":217525,"journal":{"name":"2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115091784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Deductive Verification of Message-Passing Parallel Programs 消息传递并行程序的演绎验证研究

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00012

Ziqing Luo, Stephen F. Siegel

引用次数: 3

PARCOACH Extension for a Full-Interprocedural Collectives Verification 全程序间集体验证的PARCOACH扩展

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00013

Pierre Huchant, Emmanuelle Saillard, Denis Barthou, Hugo Brunie, Patrick Carribault

引用次数: 5

Towards Incremental Static Race Detection in OpenMP Programs OpenMP程序中渐进式静态竞态检测

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00009

Bradley Swain, Jeff Huang

{"title":"Towards Incremental Static Race Detection in OpenMP Programs","authors":"Bradley Swain, Jeff Huang","doi":"10.1109/Correctness.2018.00009","DOIUrl":"https://doi.org/10.1109/Correctness.2018.00009","url":null,"abstract":"OpenMP is a high level API that allows programmers to write concurrent programs on multi-core systems. OpenMP provides an interface for easily managing teams of threads and concurrent tasks allowing the programmer to focus on modeling a problem concurrently rather than dealing with low level thread management details for each system on which the code may run. Although OpenMP can automatically handle many parts of writing parallel programs (thread management, work distribution, scheduling, etc.), OpenMP offers no protection against data races. The programmer is left with the difficult task of ensuring that OpenMP programs are free of data races. Many concurrent programs, especially those related to high performance computing, can be difficult for programmers to reason through and are particularly prone to data races due to programmer error. This paper presents an extensible and incremental static analysis technique for detecting data races in OpenMP programs at compile time. Our technique is comprised of two primary components: (i): Array Index Analysis, which is used to detect when two array accesses made from separate threads may overlap resulting in multiple accesses to the same location in memory. (ii): An Incremental Phase Graph is used to build a May Happen in Parallel (MHP) model that is utilized in determining if overlapping array accesses are capable of occurring concurrently.","PeriodicalId":217525,"journal":{"name":"2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122170326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Hybrid Theorem Proving as a Lightweight Method for Verifying Numerical Software 混合定理证明作为一种轻量级的数值软件验证方法

2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness) Pub Date : 2018-11-01 DOI: 10.1109/Correctness.2018.00005

Alper Altuntas, J. Baugh

{"title":"Hybrid Theorem Proving as a Lightweight Method for Verifying Numerical Software","authors":"Alper Altuntas, J. Baugh","doi":"10.1109/Correctness.2018.00005","DOIUrl":"https://doi.org/10.1109/Correctness.2018.00005","url":null,"abstract":"Large-scale numerical software requires substantial computer resources that complicate testing and debugging. A single run of a climate model may require many millions of core-hours and terabytes of disk space, making trial-and-error experiments burdensome and time consuming. In this study, we apply hybrid theorem proving from the field of cyber-physical systems to problems in scientific computation, and show how to verify the correctness of discrete updates that appear in the simulation of continuous physical systems. By viewing numerical software as a hybrid system that combines discrete and continuous behavior, test coverage and confidence in findings can be increased. We describe abstraction approaches for modeling numerical software and demonstrate the applicability of the approach in a case study that reproduces undesirable behavior encountered in a parameterization scheme, called the K-profile parameterization, widely used in ocean components of large-scale climate models. We then identify and model a fix in the configuration of the scheme, and verify that the undesired behavior is eliminated for all possible execution sequences. We conclude that hybrid theorem proving is an effective and efficient approach that can be used to verify and reason about properties of large-scale numerical software.","PeriodicalId":217525,"journal":{"name":"2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126251439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2