%0 Conference Proceedings
%B IEEE Latin American Test Symposium, 20 (LATS)
%@resumeid
%@resumeid
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHTU
%X Context: Model-Based Testing (MBT) is a technique that employs formal models to represent reactive systems behavior and generates test cases. Such systems are mostly specified and verified using Finite State Machines (FSMs). There is a plethora of test generation algorithms in the literature. Most of them are graph-based once an FSM can be formally defined as a graph. Nevertheless, there is a lack of studies on analyzing cost and efficiency of FSM-based test generation algorithms. Objective: This study aims to compare graph-based algorithms employed to generate test cases from FSM models. In particular, we compare the Chinese Postman Problem (CPP) and H-Switch Cover (HSC) algorithms with the well-known depth-first and breadth-first searches algorithms in the context of covering all-transitions and all-transition-pairs criteria in an FSM. Method: First, a systematic literature mapping was conducted to summarize the algorithms that have been adopted in MBT, considering FSM. The main algorithms found were implemented and analyzed in different experiments. Results: CPP presented better results with the FSMs used in terms of number of test cases and test suite size. In addition, CPP also presented low distribution of average length compared to other algorithms.
%T Analyzing graph-based algorithms employed to generate test cases from finite state machines
%@isbn 978-172811756-0
%@electronicmailaddress matheus.mariano@inpe.br
%@electronicmailaddress ericasouza@utfpr.edu.br
%@electronicmailaddress andreendo@utfpr.edu.br
%@electronicmailaddress vijay.nl@inpe.br
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP 8JMKD3MGPCW/3F2PHGS
%@secondarytype PRE CI
%K —Software Testing, Model Based Testing, Finite State Machine, Graph-based algorithms.
%8 11-13 mar.
%@usergroup self-uploading-INPE-MCTI-GOV-BR
%@usergroup simone
%@group CAP-COMP-SESPG-INPE-MCTIC-GOV-BR
%@group
%@group
%@group LABAC-COCTE-INPE-MCTIC-GOV-BR
%@tertiarymark Trabalho não Vinculado à Tese/Dissertação
%@secondarykey INPE--PRE/
%2 sid.inpe.br/mtc-m21c/2019/06.14.15.13.55
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Universidade Tecnológica Federal do Paraná (UFTPR)
%@affiliation Universidade Tecnológica Federal do Paraná (UFTPR)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@versiontype publisher
%I IEEE
%4 sid.inpe.br/mtc-m21c/2019/06.14.15.13
%@documentstage not transferred
%D 2019
%S Proceedings
%A Mariano, Matheus Monteiro,
%A Souza, Érica F.,
%A Endo, André T.,
%A Vijaykumar, Nandamudi Lankalapalli,
%C Santiago, Chile
%@area COMP
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}