Systems Verification using Randomized Exploration of Large State Spaces

Abstract : Exhaustive verification often suffers from the state-explosion problem, where the reachable state space is too large to fit in main memory. For this reason, and because of disk swapping, once the main memory is full very little progress is made, and the process is not scalable. To alleviate this, partial verification methods have been proposed, some based on randomized exploration, mostly in the form of random walks. In this paper, we enhance partial, randomized state-space exploration methods with the concept of resource-awareness: the exploration algorithm is made aware of the limits on resources, in particular memory and time. We present a memory-aware algorithm that by design never stores more states than those that fit in main memory. We also propose criteria to compare this algorithm with similar other algorithms. We study properties of such algorithms both theoretically on simple classes of state spaces and experimentally on some preliminary case studies.
Liste complète des métadonnées

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-00953617
Contributor : Arnaud Legrand <>
Submitted on : Friday, February 28, 2014 - 2:11:30 PM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM
Document(s) archivé(s) le : Friday, May 30, 2014 - 3:30:28 PM

File

Abed-Vincent-SPIN-2008.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00953617, version 1

Collections

Citation

Nazha Abed, Stavros Tripakis, Jean-Marc Vincent. Systems Verification using Randomized Exploration of Large State Spaces. SPIN, 2008, Los Angeles. ⟨hal-00953617⟩

Share

Metrics

Record views

317

Files downloads

146