Dataflow analysis for datarace-free programs
From MaRDI portal
Publication:3000580
DOI10.1007/978-3-642-19718-5_11zbMATH Open1326.68074OpenAlexW1751824204MaRDI QIDQ3000580FDOQ3000580
Authors:
Publication date: 19 May 2011
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_11
Recommendations
Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Title not available (Why is that?)
- Monotone data flow analysis frameworks
- The Java memory model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dataflow analysis for datarace-free programs
- Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
- 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.
- Title not available (Why is that?)
- 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
Uses Software
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)
