Behavioral Verification of Distributed Concurrent Systems with BOBJ

  • Authors:
  • Joseph Goguen;Kai Lin

  • Affiliations:
  • -;-

  • Venue:
  • QSIC '03 Proceedings of the Third International Conference on Quality Software
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Following a brief introduction to classical and behavioralalgebraic specification, this paper discusses the verificationof behavioral properties using BOBJ, especially its implementationof conditional circular coinductive rewriting withcase analysis. This formal method is then applied to provingcorrectness of the alternating bit protocol, in one of itsless trivial versions. We have tried to minimize mathematicsin the exposition, in part by giving concrete illustrationsusing the BOBJ system.