Refinement in Finite State Machine Testing

• Autorzy: Ipate F. , Bălănescu T.
• Języki publikacji: EN

Abstrakty

EN

The paper formalizes two types of refinement for finite state machines: OR refinement and p-OR refinement. For each such type of refinement, it shows that, if the implementation is also constructed through a process of refinement, then the application of Chow's W test generation method can be distributed into smaller chunks, thus diminishing the effort devoted to testing and the size of the final test set.

Słowa kluczowe

EN

finite state machine; testing; test generation; verification; W-method

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 64, nr 1-4
• Strony: 191--203
• Opis fizyczny: Bibliogr. 20 poz., wykr.

Twórcy

autor

Ipate F.

• University of Pitesti, Str.Targu din Vale 1, 0300 Pitesti, Romania

autor

Bălănescu T.

• University of Pitesti, Str.Targu din Vale 1, 0300 Pitesti, Romania

Bibliografia

• [1] T. Bălănescu, M. Gheorghe, F. Ipate, and M. Holcombe, Formal black box testing for partially specified deterministic finite state machines, Foundations of Computing and Decision Systems, 28 (2003), no. 1, 17–28.
• [2] T. Bălănescu and F. Ipate, Wp method for partially specified deterministic finite state machines, Annals of Bucharest University, LIII (2004), no. 1, 47–60.
• [3] G. v. Bochmann and A. Petrenko, Protocol testing: Review of methods and relevance for software testing, ACM International Symposium on Software Testing and Analysis (Seattle, USA), 1994, pp. 109–123.
• [4] K. Bogdanov, Automatic Testing of Harel’s Statecharts, Ph.D. thesis, The University of Sheffield, 2000.
• [5] K. Bogdanov and M. Holcombe, Statechart testing method for aircraft control systems, J. Softw. Test. Verific. Reliability, 11 (2001), 39–54.
• [6] E. Boiten and J. Derrick, Unifying concurrent and relational refinement, Electronic Notes in Theoretical Computer Science, 70 (2002), 38–73.
• [7] S.D. Brookes and A.W. Roscoe, An improved failures model for communicating processes, Pittsburgh Symposium on Concurrency, Lecture Notes in Computer Science, vol. 197, 1985, pp. 281–305.
• [8] T.S. Chow, Testing software design modeled by finite-state, IEEE Trans. Softw. Engrg, 4 (1978), 178–187.
• [9] S. Eilenberg, Automata, Languages and Machines, Encyclopaedia of Mathematical Sciences, Academic Press, 1974.
• [10] S. Fujiwara, G. v. Bochmann, F. Khendek,M. Amalou, and A. Ghedamsi, Test selection based on finite state models, IEEE Trans. Softw. Engrg., 17 (1991), 591–603.
• [11] M. Holkombe and F. Ipate, Correct Systems: Building a Business Process Solution, Springer-Verlag, 1998.
• [12] F. Ipate and M. Holcombe, An integration testing method that is proved to find all faults, Intern. J. Comput. Math., 69 (1997), 159–178.
• [13] F. Ipate and M. Holcombe, An integrated refinement and testing method for stream X-machines, Appl. Algebra Engrg., Comm. Comput., 13 (2002), 67–91.
• [14] D. Lee andM. Yannakakis, Principles and methods of testing finite state machines – a survey, Proceed. IEEE, vol. 84, Lecture Notes in Computer Science, 1996, pp. 1090–1123.
• [15] G. Luo, G. v. Bochmann, and A. Petrenko, Test selection based on communicating nondeterministic finitestate machines using a generalizedWp-method, IEEE Trans. Softw. Engrg., 20 (1994), 149–161.
• [16] S. Marcus, Gramatici s¸i automate finite, Editura Academiei, 1964 (in Romanian).
• [17] R. Milner, Communication and Concurrency, Prentice-Hall, 1989.
• [18] A. Petrenko, Fault model-driven test derivation from finite state models: Annotated bibliography, Modelling and Verification of Parallel Processes, 4th Summer School, MOVEP 2000, Lecture Notes in Comput. Sci., vol. 2067, Springer-Verlag, 2001, pp. 196–205.
• [19] A. Petrenko, N. Yevtushenko, and G. v. Bochmann, Testing deterministic implementations from nondeterministic FSM specifications, Proc. 9th International Workshop on Testing of Communicating Systems (IWTCS’96), 1996, pp. 125–140.
• [20] M. Urbasek, Net transformations for Petri net technology, Bulletin of the EATCS, 80 (2003), 77–94