5015 search results - page 15 / 1003 » Model Checking a Path |
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
TSE
2011
13 years 2 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
PLDI
2010
ACM
14 years 17 days ago
2010
ACM
Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executa...
DATE
2002
IEEE
14 years 14 days ago
2002
IEEE
In this work, the problem of open faults affecting the interconnections of SC circuits composed by data-path and control is analyzed. In particular, it is shown that, in case open...