Results 1  10
of
25
BEEM: Benchmarks for explicit model checkers
 In Proc. of SPIN Workshop, volume 4595 of LNCS
, 2007
"... Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their correctness properties (both safety and liveness). The benchmark set is accompanied by an comprehensive web portal, which prov ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their correctness properties (both safety and liveness). The benchmark set is accompanied by an comprehensive web portal, which provides detailed information about all models. The web portal also includes information about state spaces and facilities for selection of models for experiments. The address of the web portal is
Enhancing random walk state space exploration
 In Proc. of Formal Methods for Industrial Critical Systems (FMICS’05
, 2005
"... Abstract. We study the behaviour of the random walk method in the context of model checking and its capacity to explore a state space. We describe the methodology we have used for observing the random walk and report on the results obtained. We also describe many possible enhancements of the random ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We study the behaviour of the random walk method in the context of model checking and its capacity to explore a state space. We describe the methodology we have used for observing the random walk and report on the results obtained. We also describe many possible enhancements of the random walk and study their behaviour and limits. Finally, we discuss some practically important but often neglected issues like counterexamples, coverage estimation, and setting of parameters. Similar methodology can be used for studying other state space exploration techniques like bitstate hashing, partial storage methods, or partial order reduction. 1
How to Order Vertices for Distributed LTL ModelChecking Based on Accepting Predecessors
 IN: PROCEEDINGS OF THE 4TH INTERNATIONAL WORKSHOP ON PARALLEL AND DISTRIBUTED METHODS IN VERIFICATION (PDMC 2005
, 2005
"... Distributed automatabased LTL modelchecking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one o ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Distributed automatabased LTL modelchecking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of modelchecking as an imperfect ordering can enforce numerous reexplorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally to find out which of these work well.
Efficient LargeScale Model Checking
, 2009
"... Model checking is a popular technique to systematically and automatically verify system properties. Unfortunately, the wellknown state explosion problem often limits the extent to which it can be applied to realistic specifications, due to the huge resulting memory requirements. Distributedmemory m ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Model checking is a popular technique to systematically and automatically verify system properties. Unfortunately, the wellknown state explosion problem often limits the extent to which it can be applied to realistic specifications, due to the huge resulting memory requirements. Distributedmemory model checkers exist, but have thus far only been evaluated on smallscale clusters, with mixed results. We examine one wellknown distributed model checker in detail, and show how a number of additional optimizations in its runtime system enable it to efficiently check very demanding problem instances on a largescale, multicore compute cluster. We analyze the impact of the distributed algorithms employed, the problem instance characteristics and network overhead. Finally, we show that the model checker can even obtain good performance in a highbandwidth computational grid environment.
Model Classifications and Automated Verification
 In Formal Methods for Industrial Critical Systems (FMICS’07
, 2007
"... Abstract. Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are complementary — each technique works well for different type of input instances. Unfortunately, it is not clea ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are complementary — each technique works well for different type of input instances. Unfortunately, it is not clear how to choose an appropriate technique for a specific instance of a problem. In this work we argue that this problem, selection of a technique and tuning its parameter values, should be considered as a standalone problem (a verification metasearch). We propose several classifications of models of asynchronous system and discuss applications of these classifications in the context of explicit finite state model checking. 1
Dynamic delayed duplicate detection for external memory model checking
, 2008
"... Abstract. Duplicate detection is an expensive operation of diskbased model checkers. It consists of comparing some potentially new states, the candidate states, to previous visited states. We propose a new approach to this technique called dynamic delayed duplicate detection. This one exploits some ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Duplicate detection is an expensive operation of diskbased model checkers. It consists of comparing some potentially new states, the candidate states, to previous visited states. We propose a new approach to this technique called dynamic delayed duplicate detection. This one exploits some typical properties of states spaces, and adapts itself to the structure of the state space to dynamically decide when duplicate detection must be conducted. We implemented this method in a new algorithm and found out that it greatly cuts down the cost of duplicate detection. On some classes of models, it performs significantly better than some previously published algorithms. Model checking, or state space analysis, is a method to prove that finite state systems match their specification. Given a model of the system and a property, e.g., a temporal logic formula, it explores all the possible configurations, i.e., the state space, of the system to check the validity of the property. Despite its simplicity, its practical application is limited due to the wellknown state
Properties of State Spaces and Their Applications
 SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER
"... Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large collection of state spaces and extensively study their structural properties. Our results show that state spaces have se ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large collection of state spaces and extensively study their structural properties. Our results show that state spaces have several typical properties, i.e., they are not arbitrary graphs. We also demonstrate that state spaces differ significantly from random graphs and that different classes of models (application domains, academic vs industrial) have different properties. We discuss consequences of these results for model checking experiments and we point out how to exploit typical properties of state spaces in practical model checking algorithms.
Layered duplicate detection in externalmemory model checking
 SPIN 2008. LNCS
, 2008
"... This paper presents a diskbased explicit state model checking algorithm that uses an approach called layered duplicate detection. In this approach, states encountered during a breadthfirst traversal of the graph of the transition system are stored in memory according to the layer of the graph in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents a diskbased explicit state model checking algorithm that uses an approach called layered duplicate detection. In this approach, states encountered during a breadthfirst traversal of the graph of the transition system are stored in memory according to the layer of the graph in which they are first encountered. With this layered organization of memory, transition locality is exploited by checking only the most recent layers for duplicates. In RAM, exploiting transition locality in this way saves time. In external memory, it saves space. In addition, a layered structure allows an easy method of counterexample reconstruction in diskbased model checking. We prove a worstcase linear bound on the redundant work performed by our approach. Experimental results indicate that average case redundant work is much better than the worstcase. The implemented model checker has been used to verify a transition system that required more than 275 GBs of disk storage.