Reasoning about threads communicating via locks
From MaRDI portal
Recommendations
Cited in
(24)- Analyzing pushdown systems with stack manipulation
- Verifying parallel programs with dynamic communication structures
- Improving thread-modular abstract interpretation
- Model checking dynamic pushdown networks
- Automated formal analysis and verification: an overview
- Reachability for dynamic parametric processes
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- Reasoning about threads with bounded lock chains
- Model checking concurrent programs
- Verification of higher-order concurrent programs with dynamic resource creation
- Language Strength Reduction
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- An automata-theoretic approach to infinite-state systems
- Games on Multi-stack Pushdown Systems
- The Complexity of Predicting Atomicity Violations
- Verifying Parallel Programs with Dynamic Communication Structures
- Symbolic predictive analysis for concurrent programs
- Program-Conflict-Analysis
- Deadlock checking by a behavioral effect system for lock handling
- Verification of asynchronous programs with nested locks
- Reachability under contextual locking
- Reachability under contextual locking
- Distributed controller synthesis for deadlock avoidance
- Model-checking parametric lock-sharing systems against regular constraints
This page was built for publication: Reasoning about threads communicating via locks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716592)