Designing bug-free protocols with SPIN

Computer Communications

Volumn 20, Issue 2, 1997, Pages 97-105

  Holzmann, Gerard J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Protocol design; Robust software; SPIN

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SOFTWARE; DISTRIBUTED COMPUTER SYSTEMS; SYSTEMS ANALYSIS;

AUTOMATED VERIFICATION TOOL; PROTOCOL DESIGN; ROBUST SOFTWARE; SYNCHRONOUS RENDEZVOUS OPERATIONS;

NETWORK PROTOCOLS;

EID: 0031100059     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(96)01150-4     Document Type: Article

References (29)

1. J. Hajek, Automatically verified data transfer protocols, Proc. 4th International Computer Conference, Kyoto, Japan, 1978, pp. 749-756.
2. C.H. West, General technique for communications protocol validation, IBM J. Research and Development, 22(4) (1978) 393.
3. G.J. Holzmann, An algebra for protocol validation, Proc. First IFIP/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV81, NPL, Teddington, England, 1981.
4. E.M. Clarke and E.A. Emerson, Synthesis of synchronization skeletons for branching time temporal logic, Proc. Logic of Programs: Workshop, Yorktown Heights, NY, May 1981 (LNCS, Vol 131, Springer-Verlag, 1981).
5. J.P. Quielle and J. Sifakis, Specification and verification of concurrent programs in Cesar, Proc. 5th Int. Symposium on Programmiong, LNCS, vol. 137, pp. 195-220, Springer-Verlag, 1982.
6. G.J. Holzmann, An improved protocol reachability analysis technique, Software, Practice and Experience, 18(2) (1988) 137-161. (First published in: Proc. PSTV87 Conference, Zurich, Switzerland, 1981.)
7. G.J. Holzmann, An improved protocol reachability analysis technique, Software, Practice and Experience, 18(2) (1988) 137-161. (First published in: Proc. PSTV87 Conference, Zurich, Switzerland, 1981.)
8. K.L. McMillan, Symbolic Model Checking, Kluwer Academic, Dordrecht, 1993.
9. D. Peled, Combining partial order reductions with on-the-fly model checking, 6th Int. Conf. on Computer Aided Verification, Stanford, CA, June 1994.
10. G.J. Holzmann and D. Peled, An improvement in formal verification, Proc. 7th FORTE Conference, Bern, Switzerland, 1994.
11. J. Chaves, Formal methods at AT&T, an industrial usage report, Proc. 4th FORTE Conference, Sydney, Australia, 1991, pp. 83-90.
12. T. Cattel, Modelization and verification of a multiprocessor realtime OS kernel, Proc. 7th FORTE Conferernce, Bern, Switzerland, 1994, pp. 35-51.
13. G.J. Holzmann, The theory and practice of a formal method: NewCoRe, Proc. 13th IFIP World Computer Congress, Hamburg, Germany, 1994, pp. 35-44.
14. B. Boigelot and P. Godefroid, Model checking in practice: an analysis of the ACCESS.bus(tm) protocols using SPIN, Report Univ. of Liege, Belgium and AT&T Bell Laboratories, September 1995 (submitted for publication).
15. M. Raynal, Distributed Algorithms and Protocols, Wiley, 1988, pp. 96-103.
16. A.J. Bernstein, Output guards and non-determinism in CSP, ACM Toplas, 2(2) (April 1980) 234-238.
17. E.W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM, 18(8) 453-457.
18. C.A.R. Hoare, Communicating sequential processes, Comm. ACM, 21(8) 666-677.
19. G.J. Holzmann, Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs, NJ, 1991.
20. O. Bernholz (Kupferman) and M. Vardi, On the complexity of branching modular model checking, Proc. CONCUR95 Conference, Philadelphia, August 1995.
21. D. Dolev, M. Klawe and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, J. Algorithms, 3 (1982) 245-260.
22. G.J. Holzmann, Tracing protocols, AT&T Technical J., 64 (December 1985) 2413-2434.
23. G.J. Holzmann, An analysis of bitstate hashing, Proc. IFIP/ WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV95, Warsaw, Poland, June 1995.
24. A. Pnueli, The temporal logic of programs, Proc. 18th IEEE Symposium on Foundations of Computer Science, Providence, RI, 1977, pp. 46-57.
25. E.M. Clarke, E.A. Emerson and A.P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications. Toplas, 8(2) (1986) 244-263.
26. C. Courcoubetis, M. Vardi, P. Wolper and M. Yannakakis, Memory efficient algorithms for the verification of temporal properties, Formal Methods in System Design, I, 1992, pp. 275-288.
27. P. Godefroid and G.J. Holzmann, On the verification of temporal properties, Proc. IFIP/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV93, Liege, Belgium, June 1993.
28. G.J. Holzmann, Automated protocol validation in Argos, assertion proving and scatter searching, IEEE Trans. Software Engineering, 13(6) (June 1987) 683-697.
29. R. Gerth. D. Peled, M.Y. Vardi and P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, Proc. IFIP/WG6.1 Symp. on Protocol Specification, Testing, and Verification, PSTV95, Warsaw, Poland, June 1995.