Third International Conference On Quality Software Behavioral Verification of Distributed Concurrent Systems with BOBJ Dallas, Texas November 06-November 07 ISBN: 0-7695-2015-4
Following a brief introduction to classical and behavioral algebraic specification, this paper discusses the verification of behavioral properties using BOBJ, especially its implementation of conditional circular coinductive rewriting with case analysis. This formal method is then applied to proving correctness of the alternating bit protocol, in one of its less trivial versions. We have tried to minimize mathematics in the exposition, in part by giving concrete illustrations using the BOBJ system.
Citation:
Joseph Goguen, Kai Lin, "Behavioral Verification of Distributed Concurrent Systems with BOBJ," qsic, pp.216, Third International Conference On Quality Software, 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||