Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A method of automatic proof for the specification and verification of protocols

A method of automatic proof for the specification and verification of protocols In this paper we apply a method of automatic proof to verify some properties of a computer network protocol. The method used is defined as an extension of classical resolution to temporal operators (@@@@), (@@@@), (@@@@) and Until . We define a Precedes operator that is very useful for the specification of protocols. The method has the form of a set of recursive rules. The examples that we give are FIFO and LIFO queues and the alternating bit protocol, and the properties that we verify are livennes properties of the Sender and Receiver processes in order to prove a liveness property of the global system. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGCOMM Computer Communication Review Association for Computing Machinery

A method of automatic proof for the specification and verification of protocols

Loading next page...
 
/lp/association-for-computing-machinery/a-method-of-automatic-proof-for-the-specification-and-verification-of-lYxfjU042Z

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISSN
0146-4833
DOI
10.1145/639624.802066
Publisher site
See Article on Publisher Site

Abstract

In this paper we apply a method of automatic proof to verify some properties of a computer network protocol. The method used is defined as an extension of classical resolution to temporal operators (@@@@), (@@@@), (@@@@) and Until . We define a Precedes operator that is very useful for the specification of protocols. The method has the form of a set of recursive rules. The examples that we give are FIFO and LIFO queues and the alternating bit protocol, and the properties that we verify are livennes properties of the Sender and Receiver processes in order to prove a liveness property of the global system.

Journal

ACM SIGCOMM Computer Communication ReviewAssociation for Computing Machinery

Published: Jun 1, 1984

There are no references for this article.