Automatic Analysis and Test Case Derivation for a Restricted Class of LOTOS Expressions with Data Parameters

IEEE Transactions on Software Engineering

Volumn 20, Issue 1, 1994, Pages 29-42

  Higashino, Teruo ^a   Bochmann, Gregor V ^b  

^a OSAKA UNIVERSITY   (Japan)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Automatic test case derivation; communication protocols; conformance testing; formal description techniques; LOTOS; protocol models

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; MODELS; NETWORK PROTOCOLS;

AUTOMATIC CASE; COMMUNICATION PROTOCOLS; CONFORMANCE TESTING; LOTOS; PROTOCOL MODEL;

AUTOMATA THEORY;

EID: 0028202308     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.263753     Document Type: Article

References (27)

1. G. v. Bochmann, “Protocol specification for OSI” Comput. Networks and ISDN Syst., vol. 18, pp. 167-184, Apr. 1990.
2. T. Bolognesi and E. Brinksma, “Introduction to the ISO specification language LOTUS,” Comput. Networks and ISDN Syst., vol. 14, pp. 25-59, 1987.
3. E. Brinksma, “A theory for the derivation of tests,” Proc. 8th Int. Conf. Protocol Specification, Testing and Verification. North-Holland, 1988, pp. 63-74.
4. E. Brinksma, R. Alderden, R. Langerak, J. v. d. Lagemaat, and J. Tretmans, mans, “Formal approach to conformance testing,” Proc. Int. Workshop on Protocol Test Systems (IWPTS‘ 89). North-Holland, 1989, pp. 311-325.
5. CCITT, “SDL: Specification and description language,” Recommendation Z.100, Nov. 1988.
6. H. Eertink and D. Wolz, “Symbolic execution of LOTOS specifications,” Proc. 5th Int. Conf. on Formal Description Techniques (FORTE 92). North-Holland, 1992, pp. 295-310.
7. P. H. J. v. Eijk, C. A. Vissers, and M. Diaz, Eds., The Formal Description Technique LOTOS. North-Holland, 1989, p. 451.
8. A. Fantechi, S. Gnesi, and G. Mazzarini, “How much expressive are LOTOS behavior expressions?,” Proc. 3rd Int. Conf. on Formal Description Techniques (FORTE‘ 90), North-Holland, 1990, pp. 17-32.
9. S. Fujiwara, G. V. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, “Test selection based on finite state models,” IEEE Trans. Soft. Eng., vol. 17, pp. 591-603, June 1991.
10. S. Fujiwara and G. von Bochmann, “Testing nondeterministic state machines with fault coverage,” Proc. 4th Int. Workshop on Protocol Test Systems (IWPTS‘92), North-Holland, 1991, pp. 267-280.
11. R. Guillemot and L. Logrippo, “Derivation of useful execution trees from LOTOS specifications by using an interpreter,” Proc. 1st lnt. Conf. on Formal Description Techniques (FORTE‘ 88). North-Holland, 1988, pp. 311-325.
12. D. Gueraichi and L. Logrippo, “Derivation of test cases for LAP—B from a LOTOS specification,” Proc. 2nd Int. FORTE Conf. North-Holland, 1989, pp. 361-374.
13. T. Higashino, G. v. Bochmann, X. Li, K. Yasumoto, and K. Taniguchi, “Test system for a restricted class of LOTOS Expressions with data parameters,” Proc. 5th Int. Workshop on Protocol Test Systems (IWPTS‘ 92). North-Holland, 1992, pp. 205-216.
14. T. Higashino, K. Ninomiya, T. Kimoto, K. Taniguchi, and M. Mori. “Automated verification of equivalence of protocol machines,” Proc. 9th Int. Conf. Protocol Specification, Testing and Verification (PSTV-IX) North-Holland, 1989, pp. 235-246.
15. J. E. Hoperoft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Reading, MA: Addison-Wesley, 1979.
16. ISO, “Information processing system-Open systems interconnection-Basic connection oriented Session protocol specification,” IS 8327, Aug. 1987.
17. ISO, “Information processing system, open systems interconnection, LOTOS-A formal description technique based on the temporal ordering of observational behavior,” IS 8807, Jan. 1989.
18. ISO, “Estelle: A formal description technique based on an extended state transition model,” ISO 9074, July 1989.
19. J. W. Klop, “Term rewriting systems: A tutorial,” Bull EATCS, vol. 32, pp. 143-183, 1987.
20. R. Langerak, “A testing theory for LOTOS using deadlock detection,” Proc. 9th Int. Conf. Protocol Specification, Testing and Verification (PSTV-IX). pp. 87-98, North-Holland, June 1989.
21. T. Matsuura, T. Nakamura, T. Higashino, K. Taniguchi, and S. Masuda, “VTM: A graph editor for large trees,” Proc. 12th IFIP World Computer Congress'92, vol. I. North-Holland, 1992, pp. 210-216.
22. D. C. Oppen, “A upper bound on the complexity of Presburger arithmetic,” J. Comput. Syst. Sri., vol. 16, pp. 322-332, 1978.
23. M. Presburger, “Uber die vollstandigkeit eines gewissen systems der afithmetik ganzer zahlen, in welchen die addition als einzige operation hervortritt,” in Comptes-Rendus du ler Congres des Mathematiciens des Pays Slays, 1929.
24. B. Sarikaya, G. v. Bochmann, and E. Cerny, “A test design methodology for protocol testing,” IEEE Trans. Software Eng., vol. 13, pp. 518-531, May 1987.
25. P. Tripathy and B. Safikaya, “Test generation from protocol specification,” Proc. 2nd Int. FORTE Conf. North-Holland, 1989, pp. 329-343.
26. J. Tretmans, “Test case derivation from LOTOS specifications,” Proc. 2nd Int. Conf. on Formal Description Techniques (FORTE‘ 89). North-Holland, Holland, 1989, pp. 345-359.
27. C. D. Wezeman, “The CO-OP method for compositional derivation of conformance testers,” Proc. 9th Int. Conf. Protocol Specification, Testing and Verification (PSTV-IX), North-Holland, 1989, pp. 145-158.