Using heuristic search for finding deadlocks in concurrent systems
From MaRDI portal
Publication:2573636
DOI10.1016/j.ic.2005.07.004zbMath1101.68680MaRDI QIDQ2573636
Antonella Santone, Sara Gradara, Maria Luisa Villani
Publication date: 22 November 2005
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2005.07.004
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Uses Software
Cites Work
- A CCS-based investigation of deadlock in a multi-process electronic mail system
- Complexity of analyzing the synchronization structure of concurrent programs
- Local model checking in the modal mu-calculus
- Petri-net-based deadlock analysis of process algebra programs
- Property preserving abstractions for the verification of concurrent systems
- Automatic verification of concurrent systems using a formula-based compositional approach
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Compositional minimisation of finite state systems using interface specifications
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Computer aided verification. 8th international conference, CAV '96, New Brunswick, NJ, USA, July 31 -- August 3, 1996. Proceedings
- Selective mu-calculus and formula-based equivalence of transition systems
- Efficient Verification of a Multicast Protocol for Mobile Computing
- Graph-Based Algorithms for Boolean Function Manipulation
- Formal Verification of Concurrent Systems via Directed Model Checking
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
