Sciweavers

250 search results - page 11 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
BIRTHDAY
2008
Springer
14 years 11 months ago
Approximating Behaviors in Embedded System Design
Embedded systems are electronic devices that function in the context of a physical environment, by sensing and reacting to a set of stimuli. To simplify the design of embedded syst...
Roberto Passerone, Alberto L. Sangiovanni-Vincente...
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
CTRSA
2001
Springer
120views Cryptology» more  CTRSA 2001»
15 years 1 months ago
Forward-Secure Threshold Signature Schemes
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...
Michel Abdalla, Sara K. Miner, Chanathip Namprempr...
83
Voted
FORMATS
2004
Springer
15 years 2 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
103
Voted
ECRTS
2009
IEEE
14 years 7 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan