Detecting race conditions in parallel programs that use one semaphore

DOI10.1007/3-540-57155-8_272zbMath1504.68036OpenAlexW2144629321MaRDI QIDQ5060138

Robert H. B. Netzer, Hsueh-I Lu, Philip N. Klein

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_272

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• On strictly optimal schedules for the cumulative cost-optimal scheduling problem
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

This page was built for publication: Detecting race conditions in parallel programs that use one semaphore