Sciweavers

37 search results - page 4 / 8
» Termination, Deadlock and Divergence
Sort
View
OPODIS
2003
13 years 9 months ago
Detecting Locally Stable Predicates Without Modifying Application Messages
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
CONCUR
2007
Springer
14 years 1 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol
APSEC
2008
IEEE
14 years 2 months ago
Correctness of Request Executions in Online Updates of Concurrent Object Oriented Programs
Online update is a technique that reduces the disruption caused by a software update. It does so by applying a patch to a running process as opposed to shutting down the process a...
Yogesh Murarka, Umesh Bellur
IFL
2001
Springer
14 years 2 days ago
Sized Types for Typing Eden Skeletons
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
Ricardo Pena, Clara Segura
FUIN
2008
89views more  FUIN 2008»
13 years 7 months ago
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
Wan Fokkink, Jun Pang, Anton Wijs