Sciweavers

57 search results - page 9 / 12
» The fault span of crash failures
Sort
View
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
14 years 2 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
DATE
2008
IEEE
89views Hardware» more  DATE 2008»
14 years 5 months ago
Software Protection Mechanisms for Dependable Systems
We expect that in future commodity hardware will be used in safety critical applications. But the used commodity microprocessors will become less reliable because of decreasing fe...
Ute Wappler, Martin Muller
AGENTS
2000
Springer
14 years 3 months ago
Towards a fault-tolerant multi-agent system architecture
Multi-agent systems are prone to failures typical of any distributed system. Agents and resources may become unavailable due to machine crashes, communication breakdowns, process ...
Sanjeev Kumar, Philip R. Cohen
FTCS
1998
91views more  FTCS 1998»
14 years 6 days ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen
CODES
2011
IEEE
12 years 10 months ago
Design and architectures for dependable embedded systems
The paper presents an overview of a major research project on dependable embedded systems that has started in Fall 2010 and is running for a projected duration of six years. Aim i...
Jörg Henkel, Lars Bauer, Joachim Becker, Oliv...