Sciweavers

271 search results - page 7 / 55
» Detecting Deadlocks in Concurrent Systems
Sort
View
TACS
1997
Springer
13 years 11 months ago
A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
CONCUR
2000
Springer
14 years 16 hour ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
DMS
2008
167views Multimedia» more  DMS 2008»
13 years 9 months ago
Testing Multi-agent Systems for Deadlock Detection Based on UML Models
There is a growing demand for Multi-Agent Systems (MAS) in the software industry. The autonomous agent interaction in a dynamic software environment can potentially lead to runtim...
Nariman Mani, Vahid Garousi, Behrouz Homayoun Far
EDO
2000
Springer
13 years 11 months ago
Using Model Checking to Detect Deadlocks in Distributed Object Systems
Abstract. We demonstratehow the use of synchronizationprimitives and threading policies in distributed object middleware can lead to deadlocks. We identify that objectmiddleware on...
Nima Kaveh