Sciweavers

244 search results - page 3 / 49
» Counterexamples in Probabilistic Model Checking
Sort
View
ICFEM
2007
Springer
13 years 11 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
TSE
2010
123views more  TSE 2010»
13 years 2 months ago
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
Husain Aljazzar, Stefan Leue
SPIN
2012
Springer
11 years 10 months ago
Counterexample Explanation by Anomaly Detection
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a significant amount of manual work is required in order to locate the fault that...
Stefan Leue, Mitra Tabaei Befrouei
SSS
2009
Springer
128views Control Systems» more  SSS 2009»
14 years 7 hour ago
Dependability Engineering of Silent Self-stabilizing Systems
Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for man...
Abhishek Dhama, Oliver E. Theel, Pepijn Crouzen, H...