A simple proof technique for priority-scheduled systems

DOI10.17615/XGWZ-SH37MaRDI QIDQ1607082zbMATH OpenOpenAlexWikidataFDO

Authors James H. Anderson, Mark Moir, Srikanth Ramamurthy

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00193-9

zbMATH Keywords

concurrent programspriority-scheduled systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A general technique for proving lock-freedom
• A proof technique for parallel programs
• Wait-free linearization with a mechanical proof
• scientific article; zbMATH DE number 3958701
• scientific article; zbMATH DE number 4096767

Cites work

• scientific article; zbMATH DE number 53313 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• Implementing wait-free objects on priority-based systems
• Priority inheritance protocols: an approach to real-time synchronization
• Real-time object sharing with minimal system support
• Wait-free synchronization in multiprogrammed systems

Cited in

(3)

• Priority inheritance protocol proved correct
• Priority inheritance protocol proved correct
• scientific article; zbMATH DE number 7362744 (Why is no real title available?)

This page was built for publication: A simple proof technique for priority-scheduled systems

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