68 search results - page 3 / 14 » Scalable Distributed On-the-Fly Symbolic Model Checking |
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
CADE
2011
Springer
12 years 6 months ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
APN
2008
Springer
13 years 8 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
SPIN
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs...
CONCUR
2003
Springer
13 years 11 months ago
2003
Springer
Multi-valued model-checking is an extension of classical model-checking to reasoning about systems with uncertain information, which are common during early design stages. The addi...