Algorithms for automated protocol verification

@article{Holzmann1990AlgorithmsFA,
  title={Algorithms for automated protocol verification},
  author={Gerard J. Holzmann},
  journal={AT&T Technical Journal},
  year={1990},
  volume={69},
  pages={32-44}
}
This paper studies the four basic types of algorithm that, over the last 10 years, have been developed for the automated verification of the logical consistency of data communication protocols. The algorithms are compared on memory usage, CPU time requirements, and the quality of the search for errors. It is shown that the best algorithm, according to above criteria, can be improved further in a significant way, by avoiding a known performance bottleneck. The algorithm derived in this manner… CONTINUE READING
39 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Norigoe, “An Acyclic Expansion Algorithm for Fast Protocol Verification,

  • Y. Kakuda, Y. Wakahara
  • IEEE Transactions on Software Engineering,
  • 1988

A Petri Net Tool for Service Verification in Protocols,

  • A. Bourguet
  • Proceedings of Sixth Workshop on Protocol…
  • 1986

Lapone, “PAV-Protocol Analyzer and Verifier,

  • A.M.K.K. Sabnani
  • Proceedings of Sixth Workshop on Protocol…
  • 1986

Valira-aTool for Protocol Verification via Reachability Analysis,

  • S. T. Vuong, D. D. Hui, D. D. Cowan
  • Proceedings of Sixth Workshop on Protocol…
  • 1986

PANDORA - an interactive system for the design of data communication protocols

  • C. H. West
  • Computer Networks
  • 1984

Similar Papers

Loading similar papers…