The sweep-line state space exploration method

  • Authors:
  • Kurt Jensen;Lars M. Kristensen;Thomas Mailund

  • Affiliations:
  • Department of Computer Science, Aarhus University, Denmark;Department of Computer Engineering, Bergen University College, Norway;Bioinformatics Research Centre, Aarhus University, Denmark

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2012

Quantified Score

Hi-index 5.23

Visualization

Abstract

The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking. The concept of progress makes it possible to delete states from the memory during state space exploration and thereby reduce peak memory usage. The contribution of this paper is twofold. First, we provide a coherent presentation of the sweep-line theory and the many variants of the method that have been developed over the past 10 years since the basic idea of the method was conceived. Second, we survey a selection of case studies where the sweep-line method has been put into practical use for the verification of concurrent systems.