Sciweavers

468 search results - page 1 / 94
» A New Type System for Deadlock-Free Processes
Sort
View
CONCUR
2006
Springer
13 years 8 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
CONCUR
2000
Springer
13 years 9 months 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
TC
2008
13 years 4 months ago
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over ti...
Olav Lysne, José Miguel Montañana, J...
CASCON
2004
110views Education» more  CASCON 2004»
13 years 6 months ago
Investigations in tree locking for compiled database applications
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
Heng Yu, Grant E. Weddell
HVC
2005
Springer
183views Hardware» more  HVC 2005»
13 years 10 months ago
Detecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when a set of thr...
Rahul Agarwal, Liqiang Wang, Scott D. Stoller