39 search results - page 1 / 8 » Uniform confluence in concurrent computation |
JFP
2000
13 years 10 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
CONCUR
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be par...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
FM
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
ESOP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...