Dataflow analysis for datarace-free programs
From MaRDI portal
(Redirected from Publication:3000580)
Recommendations
Cites work
- Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
- Dataflow analysis for datarace-free programs
- scientific article; zbMATH DE number 3485178 (Why is no real title available?)
- scientific article; zbMATH DE number 1982207 (Why is no real title available?)
- scientific article; zbMATH DE number 2087551 (Why is no real title available?)
- Monotone data flow analysis frameworks
- The Java memory model
- Thread-modular counterexample-guided abstraction refinement
Cited in
(11)- Data-race and concurrent-write freedom are undecidable.
- Non-preemptive semantics for data-race-free programs
- Improving thread-modular abstract interpretation
- Formalizing and checking thread refinement for data-race-free execution models
- Dataflow analysis for datarace-free programs
- Formalising Java’s Data Race Free Guarantee
- scientific article; zbMATH DE number 1948400 (Why is no real title available?)
- Causal Dataflow Analysis for Concurrent Programs
- Local Data Race Freedom with Non-multi-copy Atomicity
- Model checking race-freedom when ``sequential consistency for data-race-free programs is guaranteed
- Checking data-race freedom of GPU kernels, compositionally
This page was built for publication: Dataflow analysis for datarace-free programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000580)