Abstract is missing.
- Hybrid Theorem Proving as a Lightweight Method for Verifying Numerical SoftwareAlper Altuntas, John Baugh. 1-8 [doi]
- HPC Software Verification in Action: A Case Study with Tensor TranspositionErdal Mutlu, Ajay Panyala, Sriram Krishnamoorthy. 9-16 [doi]
- Correctness of Dynamic Dependence Analysis for Implicitly Parallel Tasking SystemsWonchan Lee, George Stelle, Patrick McCormick, Alex Aiken. 17-24 [doi]
- Verifying Qthreads: Is Model Checking Viable for User Level Tasking Runtimes?Noah Evans. 25-32 [doi]
- Towards Incremental Static Race Detection in OpenMP ProgramsBradley Swain, Jeff Huang. 33-41 [doi]
- Using Polyhedral Analysis to Verify OpenMP Applications are Data Race FreeFangke Ye, Markus Schordan, Chunhua Liao, Pei-Hung Lin, Ian Karlin, Vivek Sarkar. 42-50 [doi]
- Compiler-aided Type Tracking for Correctness Checking of MPI ApplicationsAlexander Huck, Jan-Patrick Lehr, Sebastian Kreutzer, Joachim Protze, Christian Terboven, Christian H. Bischof, Matthias S. Müller. 51-58 [doi]
- Towards Deductive Verification of Message-Passing Parallel ProgramsZiqing Luo, Stephen F. Siegel. 59-68 [doi]
- PARCOACH Extension for a Full-Interprocedural Collectives VerificationPierre Huchant, Emmanuelle Saillard, Denis Barthou, Hugo Brunie, Patrick Carribault. 69-76 [doi]