Software Model Checking with Spin

Advances in Computers

Volumn 65, Issue , 2005, Pages 77-108

  Holzmann, Gerard J ^a  

^a NASA HEADQUARTERS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645884125     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/s0065-2458(05)65002-4     Document Type: Review

References (56)

1. Abadi M., and Lamport L. The existence of refinement mappings. Theoretical Computer Science 82 2 (May 1991) 253-284
2. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
3. Bartlett K.A., Scantlebury R.A., and Wilkinson P.T. A note on reliable full-duplex transmission over half-duplex lines. Comm. of the ACM 12 5 (1969) 260-265
4. Bloom B.H. Spacetime trade-offs in hash coding with allowable errors. Comm. of the ACM 13 7 (2004) 422-426
5. Bochmann G.V., "Finite state description of communications protocols", Publication No. 236, Département d'informatique, Université de Montreal, July 1976
6. Bozga D.M., "Verification symbolique pour les protocoles de communication", PhD Thesis (in French), University of Grenoble, France, December 1999, Chapter 4
7. Bryant E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers C-35 8 (August 1986) 677-691
8. Büchi J.R. On a decision method in restricted second order arithmetic. Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science (1960), Stanford Univ. Press, Stanford, CA 1-11
9. Chou C.-T., and Peled D. Verifying a model-checking algorithm. Proc. Tools and Algorithms for the Construction and Analysis of Systems, TACAS, March 1996, Passau, Germany. Lecture Notes in Comput. Sci. vol. 1055 (1996), Springer-Verlag, Berlin/New York 241-257
10. Choueka Y. Theories of automata on ω-tapes: a simplified approach. Journal of Computer and System Science 8 (1974) 117-141
11. Clarke E.M., and Emerson E.A. Synthesis of synchronization skeletons for branching time temporal logic. Workshop on Logic of Programs, Yorktown Heights, NY, May 1981. Lecture Notes in Comput. Sci. vol. 131 (1982), Springer-Verlag, Berlin/New York
12. Clarke E.M., Grumberg O., and Long D.E. Model checking and abstraction. ACM-TOPLAS 16 5 (September 1994) 1512-1542
13. Clarke E.M., Grumberg O., and Peled D. Model Checking (1999), MIT Press, Cambridge, MA
14. Courcoubetis C., Vardi M.Y., Wolper P., and Yannakakis M. Memory efficient algorithms for the verification of temporal properties. in: Formal Methods in Systems Design, vol. I, 1992, pp. 275-288. First published. Proc. 2nd Conference on Computer Aided Verification (June 1990), Rutgers University, New Jersey
15. Dillinger P.C., and Manolios P. Fast and accurate bitstate verification for SPIN. Proc. 11th Spin Workshop, Barcelona, Spain. Lecture Notes in Comput. Sci. vol. 2989 (April 2004), Springer-Verlag, Berlin/New York
16. Emerson E.A., Jha S., and Peled D. Combining partial order reduction and symmetry reduction. Proc. Tools and Algorithms for the Construction and Analysis of Systems, TACAS, Enschede, The Netherlands, 1997. Lecture Notes in Comput. Sci. vol. 1217 (1997), Springer-Verlag, Berlin/New York 19-34
17. Etessami K., "Stutter-invariant languages, ω-automata, and temporal logic", in: Proc. Conf. on Computer Aided Verification, CAV, 1999, pp. 236-248
18. Etessami K., and Holzmann G.J. Optimizing Büchi automata. Proc. CONCUR2000. Lecture Notes in Comput. Sci. vol. 1877 (August 2000), Springer-Verlag, Berlin/New York 153-167
19. Gerth R., Peled D., Vardi M., and Wolper P. Simple on-the-fly automatic verification of linear temporal logic. Proc. Symp. on Protocol Specification, Testing, and Verification, Warsaw, Poland, 1995 (1995), Chapman and Hall, London 3-18
20. Godefroid P., Holzmann G.J., "On the verification of temporal properties", in: Proc. Internat. Conf. on Protocol Specification, Testing, and Verification, Liege, Belgium, May 1993, pp. 109-124
21. Hajek J., "Automatically verified data transfer protocols", in: Proc. 4th ICCC, Kyoto, 1978, pp. 749-756
22. Holzmann G.J., "PAN: a protocol specification analyzer", Technical Report TM81-11271-5, AT&T Bell Laboratories, March 1981
23. Holzmann G.J. A theory for protocol validation. IEEE Trans. on Computers C-31 8 (1982) 730-738
24. Holzmann G.J. An improved protocol reachability analysis technique. Software, Practice and Experience 18 2 (February 1988) 137-161
25. Holzmann G.J., Patti J., "Validating SDL specifications: an experiment", in: Proc. Internat Conf. on Protocol Specification, Testing, and Verification, Twente, Netherlands, June 1989, pp. 317-326
26. Holzmann G.J. Spin-A protocol analyzer. Unix Research System, vol. II, Papers. tenth ed. (January 1990), Saunders College Publ. 423-429
27. Holzmann G.J. Design and Validation of Computer Protocols (1991), Prentice Hall, Englewood Cliffs, NJ
28. Holzmann G.J., Peled D., "An improvement in formal verification", in: Proc. Conf. on Formal Description Techniques, FORTE, Bern, Switzerland, October 1994, pp. 177-194
29. Holzmann G.J., Peled D., and Yannakakis M. On nested depth-first search. Proc. 2nd Spin Workshop, Rutgers Univ., New Brunswick, NJ, August 1996. DIMACS vol. 32 (1996), American Mathematical Society, Providence, RI
30. Holzmann G.J. The model checker Spin. IEEE Trans. on Software Engineering 23 5 (May 1997) 279-295
31. Holzmann G.J. An analysis of bitstate hashing. Formal Methods in System Design 13 3 (November 1998) 287-305
32. Holzmann G.J. Designing executable abstractions. Proc. Formal Methods in Software Practice, Clearwater Beach, FL (March 1998), ACM Press
33. Holzmann G.J., and Smith M.H. A practical method for the verification of event driven systems. Proc. Internat. Conf. on Software Engineering, ICSE99, Los Angeles (May 1999) 597-608
34. Holzmann G.J., and Smith M.H. Software model checking-extracting verification models from source code. Formal Methods for Protocol Engineering and Distributed Systems (1999), Kluwer Academic, Dordrecht/Norwell, MA 481-497
35. Holzmann G.J., and Puri A. A minimized automaton representation of reachable states. Software Tools for Technology Transfer 2 3 (November 1999) 270-278
36. Holzmann G.J. The Spin Model Checker-Primer and Reference Manual (2004), Addison-Wesley, Boston, MA
37. Holzmann G.J., and Joshi R. Model-driven software verification. Proc. 11th Spin Workshop, Barcelona, Spain, April 2004. Lecture Notes in Comput. Sci. vol. 2989 (2004), Springer-Verlag, Berlin/New York 77-92
38. Kurshan R.P. Homomorphic reduction of coordination analysis. Mathematics and Applications. IMA Series vol. 73 (1995), Springer-Verlag, Berlin/New York 105-147
39. Manna Z., Pnueli A., "Tools and rules for the practicing verifier", Stanford University, Report STAN-CS-90-1321, July 1990, 34 p
40. Manna Z., and Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specification (1991), Springer-Verlag, Berlin/New York
41. McMillan K.L. Symbolic Model Checking (1993), Kluwer Academic, Boston
42. Moore G.E. Cramming more components onto integrated circuits. Electronics 19 (April 1965)
43. Peled D. On projective and separable properties. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland, 1994. Lecture Notes in Comput. Sci. vol. 787 (1994), Springer-Verlag, Berlin/New York 291-307
44. Pnueli A., "The temporal logic of programs", in: Proc. 18th IEEE Symposium on Foundations of Computer Science, 1977, Providence, RI, pp. 46-57
45. Queille J.P., Sifakis J., "Specification and verification of concurrent systems in Cesar", in: Proc. of Fifth Internat. Symp. on Programming, 1981, pp. 337-350
46. Schneider F., Easterbrook S.M., Callahan J.R., and Holzmann G.J. Validating requirements for fault tolerant systems using model checking. Proc. Internat. Conf. on Requirements Engineering, ICRE, Colorado Springs, CO (April 1998), IEEE 4-14
47. Tanenbaum A.S. Computer Networks. first ed. (1981), Prentice Hall, Englewood Cliffs, NJ (second edition 1988)
48. Tarjan R.E. Depth first search and linear graph algorithms. SIAM J. Computing 1 2 (1972) 146-160
49. LATA Switching Systems Generic Requirements (LSSGR), FR-NWT-000064, 1992 edition. Feature requirements, including: SPCS Capabilities and Features, SR-504, Issue 1, March 1996. Telcordia/Bellcore
50. Thomas W. Automata on infinite objects. In: Van Leeuwen J. (Ed). Handbook of Theoretical Computer Science vol. B (1990), Elsevier, Amsterdam 133-187
51. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. Ser. 2 42 (1936) 230-265 see p. 247
52. Vardi M.Y., Wolper P., "An automata-theoretic approach to automatic program verification", in: Proc. Symp. on Logic in Comput. Sci., Cambridge, June 1986, pp. 322-331
53. West C.H. General technique for communications protocol validation. IBM J. Res. Develop. 22 3 (1978) 393-404
54. West C.H., and Zafiropulo P. Automated validation of a communications protocol: the CCITT X. 21 recommendation. IBM J. Res. Develop. 22 1 (1978) 60-71
55. Wolper P., Vardi M.Y., Sistla A.P., "Reasoning about infinite computation paths", in: Proc. 24th IEEE Symp. on Foundations of Comput. Sci., Tucson, 1983, pp. 185-194
56. Wolper P., and Leroy D. Reliable hashing without collision detection. Proc. Conf. on Computer Aided Verification, Crete, June 1993. Lecture Notes in Comput. Sci. vol. 697 (1993), Springer-Verlag, Berlin/New York 59-70