Deadlock checking by a behavioral effect system for lock handling
DOI10.1016/j.jlap.2011.11.001zbMath1246.68097OpenAlexW2084800560MaRDI QIDQ444480
Ka I. Pun, Martin Steffen, Volker Stolz
Publication date: 14 August 2012
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2011.11.001
static analysisconcurrencyabstractiondeadlock preventionbehavioral type and effect systemssimulation relation
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Uses Software
Cites Work
- Deadlock checking by a behavioral effect system for lock handling
- The pursuit of deadlock freedom
- Type-based information flow analysis for the \(\pi\)-calculus
- Conditional must not aliasing for static race detection
- ν-Types for Effects and Freshness Analysis
- Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
- Temporal Assertions with Parametrized Propositions
- Searching for deadlocks while debugging concurrent haskell programs
- A generic type system for the Pi-calculus
- Inferring Channel Buffer Bounds Via Linear Programming
- Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
- Computer Aided Verification
- A New Type System for Deadlock-Free Processes
- Refinement of actions and equivalence notions for concurrent systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Deadlock checking by a behavioral effect system for lock handling
