Deadlock checking by data race detection
From MaRDI portal
Publication:465488
DOI10.1016/J.JLAMP.2014.07.003zbMATH Open1371.68199OpenAlexW2065314458MaRDI QIDQ465488FDOQ465488
Authors: Ka I Pun, Martin Steffen, Volker Stolz
Publication date: 23 October 2014
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.07.003
Recommendations
Cites Work
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Dynamic inference of polymorphic lock types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deadlock checking by a behavioral effect system for lock handling
- Polymorphic type, region and effect inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deadlock checking by data race detection
- Region Analysis for Race Detection
- Static Analysis
Cited In (10)
- A lightweight deadlock analysis for programs with threads and reentrant locks
- Deadlock analysis of unbounded process networks
- Generation of Initial Contexts for Effective Deadlock Detection
- Deadlock checking by data race detection
- Effect-polymorphic behaviour inference for deadlock checking
- Deadlock detection of Java bytecode
- Deadlock checking by a behavioral effect system for lock handling
- Searching for deadlocks while debugging Concurrent Haskell programs
- Automated Technology for Verification and Analysis
- The theory of deadlock avoidance via discrete control
Uses Software
This page was built for publication: Deadlock checking by data race detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465488)