Recommendations
Cites work
- scientific article; zbMATH DE number 1670563 (Why is no real title available?)
- scientific article; zbMATH DE number 1130261 (Why is no real title available?)
- scientific article; zbMATH DE number 1834570 (Why is no real title available?)
- scientific article; zbMATH DE number 3359777 (Why is no real title available?)
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Deadlock checking by a behavioral effect system for lock handling
- Deadlock checking by data race detection
- Dynamic inference of polymorphic lock types
- Polymorphic type, region and effect inference
- 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
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)