Parallel nested depth-first searches for LTL model checking

  • Authors:
  • Sami Evangelista;Laure Petrucci;Samir Youcef

  • Affiliations:
  • LIPN, CNRS, UMR, Université Paris XIII, Villetaneuse, France;LIPN, CNRS, UMR, Université Paris XIII, Villetaneuse, France;LIPN, CNRS, UMR, Université Paris XIII, Villetaneuse, France

  • Venue:
  • ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Even though the well-known nested-depth first search algorithm for LTL model checking provides good performance, it cannot benefit from the recent advent of multi-core computers. This paper proposes a new version of this algorithm, adapted to multi-core architectures with a shared memory. It can exhibit good speed-ups as supported by a series of experiments.