The concurrency workbench: a semantics-based tool for the verification of concurrent systems

  • Authors:
  • Rance Cleaveland;Joachim Parrow;Bernhard Steffen

  • Affiliations:
  • North Carolina State Univ., Raleigh;Swedish Institute of Computer Science, Kista, Sweden;Lehrstuhl fu¨r Informatik II, Aachen, Germany

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 1993

Quantified Score

Hi-index 0.01

Visualization

Abstract

The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One experience from our work is that a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms. The Workbench has been applied to the verification of communications protocols and mutual exclusion algorithms and has proven a valuable aid in teaching and research.