Data-race and concurrent-write freedom are undecidable.

DOI10.1016/S1477-8424(03)00014-9zbMath1056.68058OpenAlexW2045808495MaRDI QIDQ1399005

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

Static analysisUndecidabilityConcurrent programmingDistributed shared memoryConcurrent-write-free programsData-race-free programs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Axioms for memory access in asynchronous hardware systems
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Causal memory: definitions, implementation, and programming
• Mixed consistency
• A Shared Memory Computer Display System

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