Learn More
— We describe an extension of the SPIN model checker for use on multi-core shared-memory systems and report on its performance. We show how, with proper load balancing, the time requirements of a verification run can in some cases be reduced close to N-fold when N processing cores are used. We also analyze the types of verification problems for which(More)
Spin is software package for verification of concurrent systems. The formal models of the systems that are verified, are built in Promela-Spin's input language. We present an extension of Promela and Spin with discrete time that provides an opportunity to model systems which correct functioning crucially depends on timing parameters. The new version of the(More)
Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism allows simultaneously inserting and deleting elements. We prove that guided rewriting preserves regularity: for every regular language its closure under guided rewriting is regular(More)
We give a detailed description of SymmSpin, a symmetry-reduction package for Spin. It ooers four strategies for state-space reduction , based on the heuristic that we presented in 33, and a fth mode for reference. A series of new experiments is described, underlining the eeectiveness of the heuristic and demonstrating the generalisation of the(More)
Partial-Order Reduction is one of the main techniques used to tackle the combinatorial state explosion problem occurring in explicit-state model checking of concurrent systems. The reduction is performed by exploiting the independence of concurrently executed events which allows portions of the state space to be pruned. An important condition for the(More)
The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics). Acknowledgments There are many people and institutions who helped me in various ways during the writing of this thesis. Aware of the inevitable risk of forgetting someone, I will try to list them with some words(More)
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). For this purpose we exploit the fact that some of the basic algorithms for prob-abilistic model checking rely on matrix vector multiplication. Since this kind of linear algebraic operations are implemented very efficiently on GPGPUs, the new(More)