Automatic verification of determinism for structured parallel programs
From MaRDI portal
Recommendations
Cited in
(9)- Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms
- Verifying parallel programs with dynamic communication structures
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
- Toward a formal semantic framework for deterministic parallel programming
- Automated Verification of Concurrent Search Structures
- Modular reasoning for deterministic parallelism
- Safe nondeterminism in a deterministic-by-default parallel language
- From non-preemptive to preemptive scheduling using synchronization synthesis
This page was built for publication: Automatic verification of determinism for structured parallel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930747)