5015 search results - page 128 / 1003 » Model Checking a Path |
129
click to vote
IFM
2010
Springer
14 years 11 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 ...
90
Voted
ICCAD
2005
IEEE
15 years 9 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...
111
Voted
QEST
2008
IEEE
15 years 7 months 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...
93
Voted
FORMATS
2007
Springer
15 years 7 months 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...
102
click to vote
GLVLSI
2006
IEEE
15 years 6 months 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 ...