Dealing with Priorities and Locks for Concurrent Programs

DOI10.1007/978-3-319-68167-2_15MaRDI QIDQ5096084zbMATH OpenOpenAlexFDO

Authors Marcio Diaz, Tayssir Touili

Publication date 12 August 2022

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-68167-2_15

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrent access of priority queues
• The mutex paradigm of concurrency
• Mutual exclusion as a matter of priority
• Fast and lock-free concurrent priority queues for multi-thread systems
• Concurrent Programming
• scientific article; zbMATH DE number 42962
• Nebenläufige Programme
• scientific article; zbMATH DE number 1049169
• scientific article; zbMATH DE number 3848584

Cited in

(4)

• Mutual exclusion as a matter of priority
• Precise analysis of value-dependent synchronization in priority scheduled programs
• Verification of asynchronous programs with nested locks
• Model-checking parametric lock-sharing systems against regular constraints

This page was built for publication: Dealing with Priorities and Locks for Concurrent Programs

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