Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs

DOI10.1007/978-3-642-11266-9_17zbMath1274.68084OpenAlexW1749199034MaRDI QIDQ3401092

Immo Grabe, Frank S. de Boer

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Deadlock checking by a behavioral effect system for lock handling ⋮ Termination detection for active objects

Uses Software

• ASF+SDF
• MAGIC

This page was built for publication: Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs