The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
Violeta Gambiroza, Bahareh Sadeghi, Edward W. Knig...