Sciweavers

250 search results - page 9 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
15 years 4 months ago
Modeling and Analysis of Probabilistic Timed Systems
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
Abhishek Dubey, Derek Riley, Sherif Abdelwahed, Te...
ICECCS
2009
IEEE
161views Hardware» more  ICECCS 2009»
15 years 4 months ago
Formal Modelling and Analysis of Business Information Applications with Fault Tolerant Middleware
Distributed information systems are critical to the functioning of many businesses; designing them to be dependable is a challenging but important task. We report our experience i...
Jeremy Bryans, John S. Fitzgerald, Alexander Roman...
QEST
2006
IEEE
15 years 3 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
CSUR
1999
114views more  CSUR 1999»
14 years 9 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
CGO
2005
IEEE
15 years 3 months ago
Building Intrusion-Tolerant Secure Software
In this work, we develop a secret sharing based compiler solution to achieve confidentiality, integrity and availability (intrusion tolerance) of critical data together, rather th...
Tao Zhang, Xiaotong Zhuang, Santosh Pande