227 search results - page 34 / 46 » Bounded Model Checking of Concurrent Programs |
SAIG
2001
Springer
15 years 2 months ago
2001
Springer
Most foundational models for global computing have focused on the spatial dimension of computations, however global computing requires also new ways of thinking about the temporal ...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
PPDP
2001
Springer
15 years 2 months ago
2001
Springer
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
78
Voted
CAV
2008
Springer
14 years 11 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...