Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

  • Authors:

  • Nikolaj S. Bjørner;Anca Browne;Michael A. Colón;Bernd Finkbeiner;Zohar Manna;Henny B. Sipma;Tomás E. Uribe

  • Affiliations:

  • Computer Science Department, Stanford University, Stanford, California 94305, USA;Computer Science Department, Stanford University, Stanford, California 94305, USA;Computer Science Department, Stanford University, Stanford, California 94305, USA;Computer Science Department, Stanford University, Stanford, California 94305, USA;Computer Science Department, Stanford University, Stanford, California 94305, USA. manna@cs.stanford.edu;Computer Science Department, Stanford University, Stanford, California 94305, USA;Computer Science Department, Stanford University, Stanford, California 94305, USA

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions of the Bakery Mutual exclusion algorithm for mutual exclusion. We verify the classic two-process algorithm and simple variants, as well as an atomic parameterized version. The methods used include deductive verification rules, verification diagrams, automatic invariant generation, and finite-state model checking and abstraction.