Results 1  10
of
34
Distributed Explicit Fair Cycle Detection (Set Based Approach)
"... The fair cycle detectiou problem is at the heart of both LTL and fair CTL model checking. This paper preseuts a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distributiou of explicitly preseuted data structure and the features of ..."
Abstract

Cited by 48 (12 self)
 Add to MetaCart
The fair cycle detectiou problem is at the heart of both LTL and fair CTL model checking. This paper preseuts a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distributiou of explicitly preseuted data structure and the features of symbolic algorithm allowing for an efficient parallelisa tion. If a fair cycle (i.e. couuterexample) is detected, theu the algorithm produces a cycle, which is in general shorter than that produced by depthfirst search based algorithms, Experimental results confirm that our approach outperforms that based ou a direct implementation of the best sequential algorithm.
Parallel BreadthFirst Search LTL ModelChecking
 IN 18TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE’03
, 2003
"... We propose a practical parallel onthefly algorithm for enumerative LTL modelchecking. The algorithm is designed for a cluster of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so called backlevel edges. In particular, a parallel levelsynchroniz ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
We propose a practical parallel onthefly algorithm for enumerative LTL modelchecking. The algorithm is designed for a cluster of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so called backlevel edges. In particular, a parallel levelsynchronized breadthfirst search of the graph is performed to discover backlevel edges. For each level the backlevel edges are checked in parallel by a nested depthfirst search to confirm or refute the presence of a cycle. Several optimizations of the basic algorithm are presented and advantages and drawbacks of their application to distributed LTL modelchecking are discussed. Experimental implementation of the algorithm shows promising results.
Scalable Multicore LTL ModelChecking
 In Model Checking Software, volume 4595 of LNCS
, 2007
"... Abstract. Recent development in computer hardware has brought more widespread emergence of sharedmemory, multicore systems. These architectures offer opportunities to speed up various tasks – among others LTL model checking. In the paper we show a design for a parallel sharedmemory LTL model chec ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Recent development in computer hardware has brought more widespread emergence of sharedmemory, multicore systems. These architectures offer opportunities to speed up various tasks – among others LTL model checking. In the paper we show a design for a parallel sharedmemory LTL model checker, that is based on a distributedmemory algorithm. To achieve good scalability, we have devised and experimentally evaluated several implementation techniques, which we present in the paper. 1
Local Parallel Model Checking for the AlternationFree µCalculus
 In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN
, 2002
"... We describe the design of (several variants of) a local parallel modelchecking algorithm for the alternationfree fragment of the µcalculus. It exploits a characterisation of the problem for this fragment in terms of twoplayer games. For the corresponding winner, our algorithm determines in paral ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
(Show Context)
We describe the design of (several variants of) a local parallel modelchecking algorithm for the alternationfree fragment of the µcalculus. It exploits a characterisation of the problem for this fragment in terms of twoplayer games. For the corresponding winner, our algorithm determines in parallel a winning strategy, which may be employed for debugging the underlying system interactively, and is designed to run on a network of workstations. Depending on the variant, its complexity is linear or quadratic. A prototype implementation within the verification tool Truth shows promising results in practice.
Property Driven Distribution of Nested DFS
 University of Southampton, UK
, 2002
"... In this paper we propose a distributed algorithm for modelchecking LTL formulas that works on a network of workstations and effectively uses the decomposition of the formula automaton to strongly connected components to achieve more efficient distribution of the verification problem. In particular, ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
In this paper we propose a distributed algorithm for modelchecking LTL formulas that works on a network of workstations and effectively uses the decomposition of the formula automaton to strongly connected components to achieve more efficient distribution of the verification problem. In particular, we explore the possibility of performing a distributed nested depthfirst search algorithm.
CTL* model checking on a sharedmemory architecture
 FMSD
"... Abstract. In this article we present the parallelisation of an explicitstate CTL * model checking algorithm for a virtual sharedmemory highperformance parallel machine architecture. The algorithm uses a combination of private and shared data structures for implicit and dynamic load balancing wit ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this article we present the parallelisation of an explicitstate CTL * model checking algorithm for a virtual sharedmemory highperformance parallel machine architecture. The algorithm uses a combination of private and shared data structures for implicit and dynamic load balancing with minimal synchronisation overhead. The performance of the algorithm and the impact that different design decisions have on the performance are analysed using both mathematical cost models and experimental results. The analysis shows not only the practicality and effective speedup of the algorithm, but also the main pitfalls of parallelising model checking for sharedmemory architectures.
Distributed Partial Order Reduction of State Spaces
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (PDMC 2004) 128 (3) (2005) 63 – 74
, 2005
"... State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the fi ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the first one tries to reduce the problem to a smaller one, the other one tries to extend the computational power to solve the same problem. In this paper, we consider a combination of these two approaches and propose a distributed memory algorithm for partial order reduction.
Fighting state space explosion: Review and evaluation
 In Proc. of Formal Methods for Industrial Critical Systems (FMICS’08
, 2008
"... Abstract. In order to apply formal methods in practice, the practitioner has to comprehend a vast amount of research literature and realistically evaluate practical merits of different approaches. In this paper we focus on explicit finite state model checking and study this area from practitioner’s ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In order to apply formal methods in practice, the practitioner has to comprehend a vast amount of research literature and realistically evaluate practical merits of different approaches. In this paper we focus on explicit finite state model checking and study this area from practitioner’s point of view. We provide a systematic overview of techniques for fighting state space explosion and we analyse trends in the research. We also report on our own experience with practical performance of techniques. Our main conclusion and recommendation for practitioner is the following: be critical to claims of dramatic improvement brought by a single sophisticated technique, rather use many different simple techniques and combine them. 1
From distribution memory cycle detection to parallel model checking
 Electronic Notes in Theoretical Computer Science
, 2002
"... In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs backlevel edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state dist ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs backlevel edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state distributed memory LTL model checker by extending it with detection of accepting cycles, counterexample generation and partial order reduction. We discuss these extensions and show experimental results.