Automating software feature verification

Bell Labs Technical Journal

Volumn 5, Issue 2, 2000, Pages 72-87

  Holzmann, Gerard J ^a   Smith, Margaret H ^a  

^a UNIVERSITY OF IOWA HOSPITALS AND CLINICS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; DISTRIBUTED DATABASE SYSTEMS; WEB BROWSERS;

FEAVER VERIFICATION SYSTEMS;

SOFTWARE ENGINEERING;

EID: 0034171620     PISSN: 10897089     EISSN: None     Source Type: Journal    
DOI: 10.1002/bltj.2223     Document Type: Article

References (20)

1. D. O. Keck and P. J. Kuehn, "The feature and service interaction problem in telecommunications systems: A survey, " IEEE Trans. on Soft. Eng., Vol. 24, No. 10, Oct. 1998, pp. 779-796.
2. LATA Switching Systems Generic Requirements (LSSGR), FR-NWT-000064, 1992 edition. Feature requirements, including SPCS Capabilities and Features, SR-504, Iss. 1, Mar. 1996, Telcordia/Bellcore.
3. W. Chan, R. J. Anderson, P. Beame, S. Burns, F. Modugno, D. Notkin, and J. D. Reese, "Model checking large software specifications, " IEEE Trans. on Soft. Eng., Vol. 24, No. 7, July 1998, pp. 498-520.
4. rd Intl. Conf. on Requirements Eng. (ICRE), IEEE, Colorado Springs., Col., Apr. 6-10, 1998, pp. 4-14.
5. A. M. Turing, "On computable numbers, with an application to the Entscheidungs problem, " Proc. London Math. Soc., Ser. 2-42, 1936, pp. 230-265 (see p. 247).
6. C. Strachey, "An impossible program, " Comp. J., Vol. 7, No. 4, Jan. 1965, p. 313.
7. M. Abadi and L. Lamport, "The existence of refinement mappings, " Theoretical Comp. Sci., Vol. 82, No. 2, May 1991, pp. 253-284.
8. E. M. Clarke, O. Grumberg, and D. E. Long, "Model checking and abstraction, " ACM Trans. on Programming Lang. and Sys., Vol. 16, No. 5, Sept. 1994, pp. 1512-1542.
9. R. P. Kurshan, "Homomorphic Reduction of Coordination Analysis: Mathematics and Applications, " IMA Series, Springer-Verlag, Vol. 73, 1995, pp. 105-147.
10. D. M. Bozga, Verification symbolique pour les protocoles de communication, Ph.D. Thesis (in French), University of Grenoble, France, Dec. 1999, Chapter 4.
11. J. M. Fossaceca, J. D. Sandoz, and P. Winterbottom, "The PathStar™ Access Server: Facilitating Carrier-Scale Packet Telephony, " Bell Labs Tech. J., Vol. 3, No. 4, Oct.-Dec. 1998, pp. 86-102.
12. G. J. Holzmann and M. H. Smith, "A practical method for verifying event driven software, " Proc. 1999 Intl. Conf. on Soft. Eng., ICSE '99, Los Angeles, May 16-22, 1999, pp. 597-608.
13. G. J. Holzmann, "The model checker SPIN, " IEEE Trans. on Soft. Eng., Vol. 23, No. 5, May 1997, pp. 279-295.
14. th IEEE Symp. on Foundations of Comp. Sci., Oct. 31-Nov. 2, 1977, Providence, R. I., pp. 46-57.
15. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper, "Simple on-the-fly automatic verification of linear temporal logic, " Proc. Symp. on Protocol Spec., Testing, and Verif. (PSTV), Warsaw, Poland, June 13-16, 1995, pp. 3-18.
16. M. Y. Vardi and P. Wolper, "An automatatheoretic approach to automatic program verification, " Proc. Symp. on Logic in Comp. Sci., Cambridge, Mass., June 16-18, 1986, pp. 332-344.
17. R. Pike, D. Presotto, S. Dorward, B. Flandrena, K. Thompson, H. Trickey, and P. Winterbottom, "Plan 9 from Bell Labs, " Comput. Sys., Vol. 8, No. 3, Summer 1995, pp. 221-254.
18. J. K. Ousterhout, Tcl and the Tk Toolkit, Addison-Wesley, Reading, Mass., 1994.
19. th Conf. on Correct Hard. Des. and Verif. Meth., Sept. 27-29, 1999, Bad Herrenalb, Germany, Lecture Notes in Computer Science, Springer-Verlag, pp. 82-96.
20. W. Thomas, "Automata on infinite objects, " Handbook on Theoretical Comp. Sci., Vol. B: Formal Models & Semantics, Elsevier Science, New York, 1990.