Results 1  10
of
33
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 42 (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.
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.
Development of a verified Erlang program for resource locking
 Formal Methods in Industrial Critical Systems
, 2001
"... We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The translation algorithm has been developed to handle this productionlike code. We use the tools accompanying CRL to generate the transition systems from the specification generated by our tool. With the Caesar/Aldebaran tool set, we verified properties for our casestudy.
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.
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.
Distributed onthefly model checking and test case generation
 In Antti Valmari, editor, Proceedings of the 13th International SPIN Workshop on Model Checking of Software SPIN’2006
"... ap por t de r ech er ch e ..."
(Show Context)
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 10 (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 Local Resolution of Boolean Equation Systems
 In Proc. of PDP’05. Ieee Computer
, 2005
"... Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local BES resolution have been proposed so far, mainly in the field of verification; how ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local BES resolution have been proposed so far, mainly in the field of verification; however, these algorithms do not scale up satisfactorily as the size of BESs increases. In this paper, we propose a distributed algorithm, called DSOLVE, which performs the local resolution of a BES using a set of machines connected by a network. Our experiments for solving large BESs using clusters of PCs show linear speedups and a scalable behaviour of DSOLVE w.r.t. its sequential counterpart. 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 7 (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.
Distributed OntheFly Equivalence Checking
, 2004
"... Onthefly equivalence checking consists in comparing two Labeled Transition Systems (Ltss) modulo a given equivalence relation by exploring them in a demanddriven way. Since it avoids the explicit construction of Ltss, this method is able to detect errors even in systems that are too large to fit i ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Onthefly equivalence checking consists in comparing two Labeled Transition Systems (Ltss) modulo a given equivalence relation by exploring them in a demanddriven way. Since it avoids the explicit construction of Ltss, this method is able to detect errors even in systems that are too large to fit in the memory of a computer. In this paper, we aim at further improving the performance of onthefly equivalence checking using several machines connected by a network. We propose DSolve, a new algorithm for distributed onthefly resolution of Boolean Equation Systems (Bess), which enables equivalence checking modulo various relations characterized in terms of Bess. DSolve serves as verification engine for the distributed version of Bisimulator, an onthefly equivalence checker developed within the Cadp verification toolbox using the Open/Cæsar environment. Our experimental measures show quasilinear speedups and a good scalability of the distributed version of Bisimulator w.r.t. its sequential version.