Data-race and concurrent-write freedom are undecidable.

DOI10.1016/S1477-8424(03)00014-9MaRDI QIDQ1399005zbMATH OpenOpenAlexFDO

Authors Alvaro E. Campos, Dionel A. Suazo

Publication date 7 August 2003

Published in Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1477-8424(03)00014-9

zbMATH Keywords

UndecidabilityStatic analysisConcurrent programmingDistributed shared memoryConcurrent-write-free programsData-race-free programs

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Dataflow analysis for datarace-free programs
• Local Data Race Freedom with Non-multi-copy Atomicity
• Non-preemptive semantics for data-race-free programs
• On the verification problem for weak memory models
• Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs

Cites work

• scientific article; zbMATH DE number 108539 (Why is no real title available?)
• scientific article; zbMATH DE number 944424 (Why is no real title available?)
• A Shared Memory Computer Display System
• Axioms for memory access in asynchronous hardware systems
• Causal memory: definitions, implementation, and programming
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Mixed consistency

Cited in

(4)

• Dataflow analysis for datarace-free programs
• Local Data Race Freedom with Non-multi-copy Atomicity
• Non-preemptive semantics for data-race-free programs
• Model checking race-freedom when ``sequential consistency for data-race-free programs is guaranteed

This page was built for publication: Data-race and concurrent-write freedom are undecidable.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399005)