Dataflow analysis for datarace-free programs
From MaRDI portal
Publication:3000580
Recommendations
Cites work
- 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?)
- Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
- Dataflow analysis for datarace-free programs
- Monotone data flow analysis frameworks
- The Java memory model
- Thread-modular counterexample-guided abstraction refinement
Cited in
(11)- Checking data-race freedom of GPU kernels, compositionally
- Data-race and concurrent-write freedom are undecidable.
- scientific article; zbMATH DE number 1948400 (Why is no real title available?)
- Non-preemptive semantics for data-race-free programs
- Formalising Java’s Data Race Free Guarantee
- Dataflow analysis for datarace-free programs
- Local Data Race Freedom with Non-multi-copy Atomicity
- Improving thread-modular abstract interpretation
- Causal Dataflow Analysis for Concurrent Programs
- Formalizing and checking thread refinement for data-race-free execution models
- Model checking race-freedom when ``sequential consistency for data-race-free programs is guaranteed
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)