641 search results - page 73 / 129 » Formal Reliability Analysis Using Theorem Proving |
IPL
2007
13 years 8 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
WCC
2005
Springer
14 years 2 months ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
PPDP
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
FM
2001
Springer
14 years 1 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
QEST
2007
IEEE
14 years 3 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...