Sciweavers

40 search results - page 4 / 8
» Assume-Guarantee Reasoning for Deadlock
Sort
View
OOPSLA
2004
Springer
14 years 3 months ago
Efficient data race and deadlock prevention in concurrent object-oriented programs
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
Piotr Nienaltowski
CONCUR
2000
Springer
14 years 2 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
CONCUR
2006
Springer
14 years 1 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
14 years 2 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
CSFW
2007
IEEE
14 years 4 months ago
Reasoning about Concurrency for Security Tunnels
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
Alwyn Goodloe, Carl A. Gunter