Show simple item record

dc.contributor.authorJoseph, Thomas A.en_US
dc.contributor.authorRaeuchle, Thomasen_US
dc.contributor.authorToueg, Samen_US
dc.date.accessioned2007-04-23T16:54:33Z
dc.date.available2007-04-23T16:54:33Z
dc.date.issued1985-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-652en_US
dc.identifier.urihttps://hdl.handle.net/1813/6496
dc.description.abstractThis paper describes a methodology for modeling and verifying protocols for asynchronous message passing systems. It combines the techniques of finite state analysis and axiomatic verification. It overcomes the problem of state explosion by using variables and logical assertions where the finite state approach would require a large number of states. By explicitly including states where interactions between processes occur, the complexity of assertional proofs is significantly reduced. Properties like freedom from deadlock, freedom from unspecified message receptions, boundedness of channel size, and partial correctness can be proved. Properties of channels like losing or garbling messages can be modeled, as can premature and non-premature timeouts. The technique is illustrated by proving a sliding window flow control protocol and an alternating bit protocol that is correct only if timeouts are non-premature.en_US
dc.format.extent2263269 bytes
dc.format.extent735718 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleState Machines and Assertions (An Integrated Approach to Modelingand Verification of Distributed Systemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics