Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

ASM
2010
ASM

favoriteEmaildiscussreport

578views Computational Biology» more ASM 2010»

Synchronous Message Passing and Semaphores: An Equivalence Proof

14 years 1 months ago

Synchronous Message Passing and Semaphores: An Equivalence Proof

Download www.di.unipi.it

A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a reﬁnement which uses semaphores to implement wait control. The proof uses a most general scheduler, which is left as abstract and assumed to satisfy a few realistic, explicitly stated assumptions. We hope to provide a scheme that can be implemented by current theorem provers.

Iain Craig, Egon Börger

Real-time Traffic

ASM 2010 | Current Theorem Provers | Microbiology | Natural Encoding | Synchronous Message Exchange |

claim paper

Related Content

» Almost All Objects Are Universal in Message Passing Systems

» A General Model for Reachability Testing of Concurrent Programs

» A Framework for Verifying DataCentric Protocols

» Workflow and Process Synchronization with Interaction Expressions and Graphs

» Transactional events for ML

» From highlevel componentbased models to distributed implementations

» RoundEfficient Broadcast Authentication Protocols for Fixed Topology Classes

» The Join Calculus A Language for Distributed Mobile Programming

» Time and Asynchrony in Interactions among Distributed RealTime Objects

Post Info
More Details (n/a)

Added	11 Mar 2010
Updated	11 Mar 2010
Type	Conference
Year	2010
Where	ASM
Authors	Iain Craig, Egon Börger

Comments (0)