Sciweavers

173 search results - page 24 / 35
» On the Power of Deterministic and Sequential Communicating P...
Sort
View
IFIP
2004
Springer
14 years 26 days ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 7 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
LICS
2003
IEEE
14 years 23 days ago
Model-checking Trace Event Structures
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
P. Madhusudan
ICECCS
2005
IEEE
125views Hardware» more  ICECCS 2005»
14 years 1 months ago
Model Checking Live Sequence Charts
Live Sequence Charts (LSCs) are a broad extension to Message Sequence Charts (MSCs) to capture complex interobject communication rigorously. A tool support for LSCs, named PlayEng...
Jun Sun 0001, Jin Song Dong
CIC
2003
140views Communications» more  CIC 2003»
13 years 9 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...