Sciweavers

3224 search results - page 97 / 645
» On Checking Model Checkers
Sort
View
FORMATS
2006
Springer
14 years 21 days ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
VLSID
2007
IEEE
97views VLSI» more  VLSID 2007»
14 years 9 months ago
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardw...
Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraha...
QEST
2006
IEEE
14 years 3 months ago
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
Joost-Pieter Katoen, Ivan S. Zapreev
STTT
2010
97views more  STTT 2010»
13 years 7 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
SIGSOFT
2003
ACM
14 years 9 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer