Model checking without a model: An analysis of the heart-beat monitor of a telephone switch using VeriSoft

Proceedings of the 1998 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1998

Volumn , Issue , 1998, Pages 124-133

  Godefroid, Patrice ^a   Hanmer, Robert S ^b   Jagadeesan, Lalita Jategaonkar ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; C++ (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; DIRECTED GRAPHS; SOFTWARE TESTING; TELEPHONE SETS; TELEPHONE SWITCHING EQUIPMENT;

CONCURRENT PROCESS; COORDINATION PROBLEMS; LUCENT TECHNOLOGIES; PROPAGATION DELAYS; SWITCHING APPLICATIONS; TELEPHONE SWITCHES; TOTAL ELAPSED TIME; TRADITIONAL MODELS;

MODEL CHECKING;

EID: 84881303808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/271771.271800     Document Type: Conference Paper

References (27)

1. M. Adams J. Coplien R. Gamoke R. Hanmer F. Keeve and K. Nicodemus. Fault-Tolerant Telecommunication System Patterns. In Vlis-sides Coplien and Kerth editors Pattern Languages of Program Design - 2 pages 549-562. Addison-Wesley 1996.
2. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed Computing 2:117-126 1987.
3. A. Aho R. Sethi and J. Ullman. Compilers: Principles Techniques and Tools. Addison-Wesley 1986.
4. B. Boigelot and P. Godefroid. Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs. In Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97) volume 1217 of Lecture Notes in Computer Science pages 321-333 Twente April 1997. Springer-Verlag.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth Annual A CM Symposium on Principles of Programming Languages January 1977.
6. E.M. Clarke E.A. Emerson and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2):244-263 January 1986.
7. J.-D. Choi B. P. Miller and R. H. B. Netzer. Techniques for debugging parallel programs with flowback analysis. ACM Transactions on Programming Languages and Systems pages 491530 October 1991.
8. J. C. Corbett. Constructing abstract models of concurrent real-time software. In Proceedings of ISSTA '96 (International Symposium on Software Testing and Analysis) pages 250-260 San Diego January 1996.
9. R. Cleaveland J. Parrow and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems l(15):36-72 1993.
10. J. Chang D. Richardson and S. Sankar. Structural Specification-based Testing with ADL. In Proceedings of ISSTA '96 (International Symposium on Software Testing and Analysis) pages 62-70 San Diego January 1996.
11. D. L. Dill A. J. Drexler A. J. Hu and C. H. Yang. Protocol verification as a hardware design aid. In 1992 IEEE International Conference on Computer Design: VLSI in Computers and Processors pages 522-525 Cambridge MA October 1992. IEEE Computer Society.
12. L.K. Dillon and Q. Yu. Oracles for checking temporal properties of concurrent systems. Software Engineering Notes 19(5):140-153 December 1994. Proceedings of the 2nd ACM SIG-SOFT Symposium on Foundations of Software Engineering.
13. J.C. Fernandez H. Garavel L. Mounier A. Rasse C. Rodriguez and J. Sifakis. A toolbox for the verification of LOTOS programs. In Proc. of the 14th International Conference on Software Engineering ICSE'14 Melbourne Australia May 1992. ACM.
14. Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem volume 1032 of Lecture Notes in Computer Science. Springer-Verlag January 1996.
15. P. Godefroid. Model Checking for Programming Languages using VeriSoft. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages pages 174-186 Paris January 1997.
16. Z. Har'El and R. P. Kurshan. Software for analytical development of communication protocols. AT&T Technical Journal 1990.
17. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall 1991.
18. L. Jagadeesan A. Porter C. Puchol J.C. Ramming and L. Votta. Specification-based testing of reactive software: Tools and experiments. In Proceedings of the 19th IEEE International Conference on Software Engineering 1997.
19. D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing Analysis and verification (TAV4) pages 21-35 Vancouver Dctober 1991.
20. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACA! Symposium on Principles of Programming Languages pages 97-107 New Orleans January 1985
21. K. L. McMillan. Symbolic Model Checking. Kluv er Academic Publishers 1993.
22. S.S. Muchnick and N.D. Jones. Program Flow Analysis: Theory and Applications. Prentice-Hall 1981.
23. S. I-. Masticóla and B. G. Ryder. Non-cone irrsncy analysis. In Proceedings of Fourth ACl/ SIGPLAN Symposium on Principles & Pracice of Parallel programming pages 1291383an Diego May 1993.
24. J.P. Quielle and J. Sifakis. Specification and verificai .on of concurrent systems in CESAR. In Proc. 5th Int'l Symp. on Programming volume 137 cf Lecture Notes in Computer Science pages 337-;.51. Springer-Verlag 1981.
25. D.J. Richardson. TAOS: Testing with analysis a::d oracle support. In Proceedings of the I994 International Symposium on Software Testing aid Analysis August 1994.
26. R. N Taylor. A general-purpose algorithm for analyzing concurrent programs. Communications of the ACM pages 362-376 May 1983.
27. M.Y. Vardi and P. Wolper. An automata-theoistic approach to automatic program veri-ficatii m. In Proceedings of the First Symposium on Logic in Computer Science pages 322-331 Cambridge June 1986.