1860 search results - page 172 / 372 » A Temporal Logic of Robustness |
100
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
118
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
117
click to vote
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
127
click to vote
RTSS
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
124
Voted
CSFW
2004
IEEE
15 years 4 months ago
2004
IEEE
We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, MOCHA, which allows specification of pr...