612 search results - page 26 / 123 » Bounded model checking for knowledge and real time |
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
113
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
78
Voted
ECRTS
2003
IEEE
15 years 3 months ago
2003
IEEE
The memory model used in the Real-Time Specification for Java (RTSJ) imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus...
116
click to vote
NFM
2011
14 years 4 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...