Efficient detection of determinacy races in cilk programs

DOI10.1007/S002240000120MaRDI QIDQ1293918zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 29 June 1999

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000120

zbMATH Keywords

determinacy racesparallel multithreaded program

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Race detection and reachability in nearly series-parallel DAGs
• scientific article; zbMATH DE number 1091202
• SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs
• Safe nondeterminism in a deterministic-by-default parallel language
• A type and effect system for determinism in multithreaded programs

Cited in

(25)

• Detecting race conditions in parallel programs that use semaphores
• Programming with exceptions in JCilk
• Balanced computation of two-dimensional transforms on a tree machine
• A framework for solving VLSI graph layout problems
• Empirical comparison of race detection tools for OpenMP programs
• Synchronization debugging of hybrid parallel programs
• Efficient access history for race detection
• scientific article; zbMATH DE number 2089169 (Why is no real title available?)
• Euro-Par 2004 Parallel Processing
• Goblint: path-sensitive data race analysis
• Local Nontermination Detection for Parallel C++ Programs
• Automatic verification of determinism for structured parallel programs
• Trends in systolic and cellular computation
• scientific article; zbMATH DE number 1755936 (Why is no real title available?)
• Detecting race conditions in parallel programs that use one semaphore
• Dynamic Data-Race Detection Through the Fine-Grained Lens
• Safe nondeterminism in a deterministic-by-default parallel language
• scientific article; zbMATH DE number 1755937 (Why is no real title available?)
• scientific article; zbMATH DE number 1759992 (Why is no real title available?)
• The complexity of minimizing wire lengths in VLSI layouts
• An equational axiomatization of systolic systems
• Race detection and reachability in nearly series-parallel DAGs
• An asymptotically optimal layout for the shuffle-exchange graph
• Efficient data race detection for async-finish parallelism
• Race-condition detection in parallel computation with semaphores (extended abstract)

This page was built for publication: Efficient detection of determinacy races in cilk programs

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