5 search results - page 1 / 1 » Termination Criteria for Bounded Model Checking: Extensions ... |
ENTCS
2006
13 years 4 months ago
2006
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
CHARME
2003
Springer
13 years 10 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
CORR
2008
Springer
13 years 4 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...
CI
2000
13 years 4 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...