Sciweavers

2850 search results - page 28 / 570
» On Timed Models and Full Abstraction
Sort
View
TOCL
2008
113views more  TOCL 2008»
15 years 5 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich
PRDC
2007
IEEE
16 years 8 days ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper
ISORC
2008
IEEE
16 years 12 days ago
Compositional Feasibility Analysis of Conditional Real-Time Task Models
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be c...
Madhukar Anand, Arvind Easwaran, Sebastian Fischme...
USENIX
2007
15 years 8 months ago
MapJAX: Data Structure Abstractions for Asynchronous Web Applications
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
Daniel S. Myers, Jennifer N. Carlisle, James A. Co...
JANCL
2007
107views more  JANCL 2007»
15 years 5 months ago
Distributed knowledge
ABSTRACT. This paper provides a complete characterization of epistemic models in which distributed knowledge complies with the principle of full communication [HOE 99, GER 99]. It ...
Floris Roelofsen