Sciweavers

717 search results - page 13 / 144
» Kill-safe synchronization abstractions
Sort
View
ECOOPW
1994
Springer
14 years 3 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha
CIE
2005
Springer
14 years 4 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose
ENTCS
1998
101views more  ENTCS 1998»
13 years 10 months ago
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Marta Z. Kwiatkowska, Gethin Norman
ASIACRYPT
2004
Springer
14 years 4 months ago
Asynchronous Proactive Cryptosystems Without Agreement (Extended Abstract)
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
Bartosz Przydatek, Reto Strobl
LICS
1996
IEEE
14 years 3 months ago
Reactive Modules
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee)...
Rajeev Alur, Thomas A. Henzinger