Experimental Evaluation of Coverage Criteria for FSM-based Testing
Resumo
Para planejar a atividade de teste, os testadores devem determinar uma estratégia, incluindo um critério de cobertura, que possua uma boa relação de custo/benefício referente aos recursos disponíveis e os objetivos de teste. Propriedades teóricas conhecidas dos critérios de cobertura nem sempre são suficientes e, dessa forma, dados empíricos são necessários. Neste artigo, são apresentados resultados de uma avaliação experimental de vários critérios de cobertura usados comumente para Máquinas de Estados Finitos.
Referências
Bates, D. M. and Watts, D. G. (1988). Nonlinear Regression and Its Applications. Wiley.
Bochmann, G. v., Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, In ACM International Symposium on Software Testing and Analysis (ISSTA'94), USA, 1994.
Binder, R. (2000). Testing Object-Oriented Systems. Addison-Wesley, Inc. Chow, T. S. (1978). Testing software design modeled by finite-state machines. In IEEE Transactions on Software Engineering, 4(3):178–187.
Dorofeeva, R., El-Fakih, K., and Yevtushenko, N. (2005a). An improved conformance testing method. In Formal Techniques for Networked and Distributed Systems, volume 3731 of Lecture Notes in Computer Science, pages 204–218. Springer.
Dorofeeva, R., Yevtushenko, N., El-Fakih, K., and Cavalli, A. R. (2005b). Experimental evaluation of fsm-based testing methods. In Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), pages 23–32. IEEE Computer Society.
Frankl, P. R., Weyuker, E. J., (1993). A Formal Analysis of the Fault-Detecting Ability of Testing Methods. In IEEE Transactions Software Engineering 19(3):202-213.
Hassin, R. and Segev, D. (2005). The set cover with pairs problem. In Proceedings of the 25th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 164–176.
Karp, R. M. (1972). Reducibility among combinatorial problems. In Miller, R. E. and Thatcher, J. W., editors, Complexity of Computer Computations, pages 85–103.
Moore, E. F. (1956), Gedanken-experiments on sequential machines, In Automata Studies, Annals of Mathematics Series, No. 34, pages 129–153.
Petrenko, A., Bochmann, G. v., and Yao, M. (1996). On fault coverage of tests for finite state specifications. In Computer Networks and ISDN Systems, 29(1):81–106.
Petrenko, A. and Yevtushenko, N. (1992). Test suite generation for a fsm with a given type of implementation errors. In Proceedings of the IFIP 12th International Symposium on Protocol Specification, Testing, and Verification, pages 229–243.
Petrenko, A. and Yevtushenko, N. (2005). Testing from partial deterministic fsm specifications. IEEE Transactions on Computers, 54(9):1154–1165.
Trakhtenbrot, B. A. and Barzdin, Y. M. (1973). Finite Automata, Behaviour and Synthesis. North-Holland.
Yevtushenko, N. and Petrenko, A. (1990). Synthesis of test experiments in some classes of automata. In Automatic Control and Computer Sciences, 24(4):50–55.
Bochmann, G. v., Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, In ACM International Symposium on Software Testing and Analysis (ISSTA'94), USA, 1994.
Binder, R. (2000). Testing Object-Oriented Systems. Addison-Wesley, Inc. Chow, T. S. (1978). Testing software design modeled by finite-state machines. In IEEE Transactions on Software Engineering, 4(3):178–187.
Dorofeeva, R., El-Fakih, K., and Yevtushenko, N. (2005a). An improved conformance testing method. In Formal Techniques for Networked and Distributed Systems, volume 3731 of Lecture Notes in Computer Science, pages 204–218. Springer.
Dorofeeva, R., Yevtushenko, N., El-Fakih, K., and Cavalli, A. R. (2005b). Experimental evaluation of fsm-based testing methods. In Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), pages 23–32. IEEE Computer Society.
Frankl, P. R., Weyuker, E. J., (1993). A Formal Analysis of the Fault-Detecting Ability of Testing Methods. In IEEE Transactions Software Engineering 19(3):202-213.
Hassin, R. and Segev, D. (2005). The set cover with pairs problem. In Proceedings of the 25th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 164–176.
Karp, R. M. (1972). Reducibility among combinatorial problems. In Miller, R. E. and Thatcher, J. W., editors, Complexity of Computer Computations, pages 85–103.
Moore, E. F. (1956), Gedanken-experiments on sequential machines, In Automata Studies, Annals of Mathematics Series, No. 34, pages 129–153.
Petrenko, A., Bochmann, G. v., and Yao, M. (1996). On fault coverage of tests for finite state specifications. In Computer Networks and ISDN Systems, 29(1):81–106.
Petrenko, A. and Yevtushenko, N. (1992). Test suite generation for a fsm with a given type of implementation errors. In Proceedings of the IFIP 12th International Symposium on Protocol Specification, Testing, and Verification, pages 229–243.
Petrenko, A. and Yevtushenko, N. (2005). Testing from partial deterministic fsm specifications. IEEE Transactions on Computers, 54(9):1154–1165.
Trakhtenbrot, B. A. and Barzdin, Y. M. (1973). Finite Automata, Behaviour and Synthesis. North-Holland.
Yevtushenko, N. and Petrenko, A. (1990). Synthesis of test experiments in some classes of automata. In Automatic Control and Computer Sciences, 24(4):50–55.
Publicado
15/10/2007
Como Citar
SIMÃO, Adenilso; PETRENKO, Alexandre; MALDONADO, Jose Carlos.
Experimental Evaluation of Coverage Criteria for FSM-based Testing. In: SIMPÓSIO BRASILEIRO DE ENGENHARIA DE SOFTWARE (SBES), 21. , 2007, João Pessoa.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2007
.
p. 359-374.
DOI: https://doi.org/10.5753/sbes.2007.21316.
