The HIVE Tool for Informed Swarm State Space Exploration

  title={The HIVE Tool for Informed Swarm State Space Exploration},
  author={Anton Wijs},
  • Anton Wijs
  • Published in PDMC 1 November 2011
  • Computer Science
Swarm verification and parallel randomised depth-first search are very effective parallel techniques to hunt bugs in large state spaces. In case bugs are absent, however, scalability of the parallelisation is completely lost. In recent work, we proposed a mechanism to inform the workers which parts of the state space to explore. This mechanism is compatible with any action-based formalism, where a state space can be represented by a labelled transition system. With this extension, each worker… 
1 Citation

Figures and Tables from this paper

Compositional Model Checking with Incremental Counter-Example Construction

The main strong point of ICC is that it performs a series of model checking procedures, and that each one only explores a small part of the entire state space, making it an excellent approach in those cases where state space explosion is an issue.

Towards Informed Swarm Verification

A new method to perform large scale grid model checking where the individual jobs together form a so-called cumulatively exhaustive set, meaning that even though each job explores only a part of the state space, together, the tasks explore all states reachable from the initial state.

Parallel Randomized State-Space Search

This paper presents a technique for dramatically improving the cost- effectiveness of state-space search techniques for error detection using parallelism, and shows through a focused empirical study that the technique speeds up analysis by factors ranging from 2 to over 1000 as compared to traditional modes of state -space search.

Swarm Verification

This paper describes one such method, called swarm verification, which is becoming more and more attractive to find alternate ways to use these resources to speed up model checking tasks.

DiVinE: Parallel Distributed Model Checker

  • J. BarnatL. BrimMilan ČeškaPetr Ročkai
  • Computer Science
    2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
  • 2010
DiVinE is a tool for LTL model checking and reach ability analysis of discrete distributed systems and allows to analyze systems whose size is far beyond the size of systems that can be handled with regular sequential tools.

DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation

The explicit-state verification of complex concurrent systems, whose underlying state spaces may be prohibitively large, requires an important amount of memory and computation time, and it is tempting to push forward the capabilities of verification tools by exploiting the computing resources of massively parallel machines, such as clusters and grids.

Industrial Strength Distributed Explicit State Model Checking

This paper describes the Preach implementation including the various features that are necessary for the large models the authors target, and uses Preach to model check an industrial cache coherence protocol with approximately 30 billion states, the largest number published for a distributed explicit state model checker.

Distributed-Memory Model Checking with SPIN

This paper explores the possibility of exploiting a distributed-memory execution environment, such as a network of workstations interconnected by a standard LAN, to extend the size of the verification problems that can be successfully handled by SPIN.

LTSmin: Distributed and Symbolic Reachability

The LTSmin toolset provides means to generate state spaces from high-level specifications, to check safety properties on-the-fly, to store the resulting labelled transition systems (LTSs) in compressed format, and to minimize them with respect to (branching) bisimulation.

µCRL: A Toolset for Analysing Algebraic Specifications

µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It targets the specification of system behaviour in a process-algebraic style and of data elements in

Nuovo DRM paradiso: towards a verified fair DRM scheme

The security requirements of the scheme are formalized and using them as the basis, the scheme is verified and shows the presence of security weaknesses in the original protocols, which are addressed in the proposed extension to the scheme.