Sciweavers

392 search results - page 63 / 79
» Negation as Partial Failure
Sort
View
TGC
2005
Springer
14 years 1 months ago
Concurrency Among Strangers
Programmers write programs, expressing plans for machines to execute. When composed so that they may cooperate, plans may instead interfere with each other in unanticipated ways. P...
Mark S. Miller, Eric Dean Tribble, Jonathan S. Sha...
DSN
2002
IEEE
14 years 19 days ago
Reducing Recovery Time in a Small Recursively Restartable System
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as...
George Candea, James Cutler, Armando Fox, Rushabh ...
ISSRE
2002
IEEE
14 years 17 days ago
Fault Contribution Trees for Product Families
Software Fault Tree Analysis (SFTA) provides a structured way to reason about the safety or reliability of a software system. As such, SFTA is widely used in missioncritical appli...
Dingding Lu, Robyn R. Lutz
ECRTS
1999
IEEE
13 years 12 months ago
Handling sporadic tasks in off-line scheduled distributed real-time systems
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, o...
Damir Isovic, Gerhard Fohler
ICALP
1994
Springer
13 years 11 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
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...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige