We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
When a program P fails to satisfy a requirement R supposedly ensured by a detailed speci cation S that was used to implement P, there is a question about whether the problem arise...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
Retaining functionality of a mobile robot in the presence of faults is of particular interest in autonomous robotics. From our experiences in robotics we know that hardware is one ...
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...