Automated deadlock detection in synchronized reentrant multithreaded call-graphs

DOI10.1007/978-3-642-11266-9_17zbMATH Open1274.68084OpenAlexW1749199034MaRDI QIDQ3401092FDOQ3401092

Authors: 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

Recommendations

• A lightweight deadlock analysis for programs with threads and reentrant locks
• Deadlock detection of Java bytecode
• The theory of deadlock avoidance via discrete control
• Deadlock detection in linear recursive programs
• An automatic technique for static deadlock prevention

Mathematics Subject Classification ID

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

Cited In (6)

• A lightweight deadlock analysis for programs with threads and reentrant locks
• Termination detection for active objects
• Deadlock detection of Java bytecode
• Deadlock checking by a behavioral effect system for lock handling
• Title not available (Why is that?)
• Program visualization for debugging deadlocks in multithreaded programs

Uses Software

• ASF+SDF
• MAGIC

This page was built for publication: Automated deadlock detection in synchronized reentrant multithreaded call-graphs

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