5015 search results - page 128 / 1003 » Model Checking a Path |
192
click to vote
IFM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
150
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
170
click to vote
QEST
2008
IEEE
16 years 19 days ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
152
click to vote
FORMATS
2007
Springer
16 years 12 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
149
click to vote
GLVLSI
2006
IEEE
16 years 9 days ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...