A lightweight deadlock analysis for programs with threads and reentrant locks

DOI10.1007/978-3-319-95582-7_36zbMath1460.68030OpenAlexW2845903041MaRDI QIDQ2024377

Cosimo Laneve

Publication date: 4 May 2021

Full work available at URL: https://hal.inria.fr/hal-02392938/file/1-s2.0-S0167642318303812-main.pdf

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Deadlock analysis of unbounded process networks
• A calculus of communicating systems
• A calculus of mobile processes. II
• Complexity of some problems in Petri nets
• Deadlock detection of Java bytecode
• Deadlock Analysis of Unbounded Process Networks
• A New Type System for Deadlock-Free Processes

This page was built for publication: A lightweight deadlock analysis for programs with threads and reentrant locks