713 search results - page 60 / 143 » Model Checking and Transitive-Closure Logic |
APN
2008
Springer
15 years 1 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...
ISW
2004
Springer
15 years 4 months ago
2004
Springer
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...
DAC
2008
ACM
16 years 1 days ago
2008
ACM
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
109
click to vote
CONCUR
1997
Springer
15 years 3 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...