5015 search results - page 143 / 1003 » Model Checking a Path |
118
Voted
DC
2010
15 years 27 days ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
109
click to vote
JCS
2008
15 years 24 days ago
2008
We present a framework for evaluating and generating access control policies. The framework contains a modelling formalism called RW, which is supported by a model checking tool. ...
77
Voted
KBSE
2003
IEEE
15 years 6 months ago
2003
IEEE
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...
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....
126
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...