Bounded context-switching and reentrant locking

DOI10.1007/978-3-642-37075-5_5MaRDI QIDQ4910412zbMATH OpenOpenAlexFDO

Authors Rémi Bonnet, Rohit Chadha

Publication date 18 March 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-37075-5_5

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• Reachability under contextual locking
• Reachability under contextual locking
• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
• A lightweight deadlock analysis for programs with threads and reentrant locks
• Reasoning about threads with bounded lock chains

Cited in

(4)

• Alternation and bounded concurrency are reverse equivalent.
• Reachability under contextual locking
• Reachability under contextual locking
• Nested, but separate: isolating unrelated critical sections in real-time nested locking

This page was built for publication: Bounded context-switching and reentrant locking

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