Automated verification of functional correctness of race-free GPU programs
From MaRDI portal
Recommendations
Cites work
- A Hoare Logic for GPU Kernels
- A Hoare logic for SIMT programs
- Automated verification of functional correctness of race-free GPU programs
- Avoiding exponential explosion: generating compact verification conditions
- CIL: Intermediate language and tools for analysis and transformation of C programs
- Houdini, an annotation assistant for ESC/Java
- On decidability within the arithmetic of addition and divisibility
- On the complexity of linear arithmetic with divisibility
- Quantified Invariant Generation Using an Interpolating Saturation Prover
- Simplify: a theorem prover for program checking
- Symbolic execution and program testing
- The Daikon system for dynamic detection of likely invariants
Cited in
(10)- Automated verification of functional correctness of race-free GPU programs
- Formal verification of parallel prefix sum and stream compaction algorithms in CUDA
- Automated verification of the parallel Bellman-Ford algorithm
- A Hoare logic for SIMT programs
- A Hoare Logic for GPU Kernels
- Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels
- Static detection of uncoalesced accesses in GPU programs
- ACL2 meets the GPU: formalizing a CUDA-based parallelizable all-pairs shortest path algorithm in ACL2
- Memory access protocols: certified data-race freedom for GPU kernels
- Checking data-race freedom of GPU kernels, compositionally
This page was built for publication: Automated verification of functional correctness of race-free GPU programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703009)