Sciweavers

54 search results - page 2 / 11
» Proving Copyless Message Passing
Sort
View
ASM
2010
ASM
14 years 2 months ago
Synchronous Message Passing and Semaphores: An Equivalence Proof
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
Iain Craig, Egon Börger
ENTCS
2007
97views more  ENTCS 2007»
13 years 5 months ago
An Operational Semantics for Shared Messaging Communication
Shared Messaging Communication (SMC) has been introduced in [9] as a model of communication which reduces communication costs (both in terms of communication latency and memory us...
Astrid Kiehn
CONCUR
2004
Springer
13 years 10 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
Benedikt Bollig, Martin Leucker
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
13 years 11 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
CCECE
2006
IEEE
13 years 11 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner