Non-preemptive semantics for data-race-free programs

DOI10.1007/978-3-030-02508-3_27MaRDI QIDQ1623168zbMATH OpenOpenAlexFDO

Authors Siyang Xiao, Hanru Jiang, Hongjin Liang, Xinyu Feng

Publication date 23 November 2018

Full work available at URL https://doi.org/10.1007/978-3-030-02508-3_27

zbMATH Keywords

interleaving semanticsdata-race-freedomnon-preemptive semantics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Dataflow analysis for datarace-free programs
• Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
• Data-race and concurrent-write freedom are undecidable.
• A semantics for concurrent separation logic
• CONCUR 2004 - Concurrency Theory

Cited in

(4)

• Dataflow analysis for datarace-free programs
• Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
• Local Data Race Freedom with Non-multi-copy Atomicity
• Data-race and concurrent-write freedom are undecidable.

This page was built for publication: Non-preemptive semantics for data-race-free programs

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