Deriving test suites with the guaranteed fault coverage for extended finite state machines
Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 6, pp. 729-740.

Voir la notice de l'article provenant de la source Math-Net.Ru

Extended Finite State Machines (EFSMs) are widely used when deriving tests for checking functional requirements for software implementations. However, the fault coverage of tests covering appropriate paths, variables, etc. of the specification EFSM, remains rather obscure and such tests do not detect many functional faults in EFSM implementations. In this paper, an approach is proposed for deriving complete tests with respect to functional faults of a proper Java EFSM implementation. First, an initial test suite derived against the specification EFSM is checked with respect to faults generated by a $\mu$Java tool. Since the EFSM software implementation is template based, each undetected fault can be easily mapped into a mutant EFSM of the specification machine. Thus, a distinguishing sequence is derived for two Finite State Machines modeling two EFSMs instead of deriving such a sequence for two programs. If the corresponding FSMs are too complex or cannot be completely derived, a test suite can be incomplete. However, the performed experiments clearly show that a test suite extended by such distinguishing sequences detects much more functional faults in software implementations of a system whose behaviour is described by the given EFSM.
Keywords: Mutation testing, Extended Finite State Machine (EFSM), finite automata
Mots-clés : $\mu$Java.
@article{MAIS_2016_23_6_a4,
     author = {A. D. Ermakov and N. V. Yevtushenko},
     title = {Deriving test suites with the guaranteed fault coverage for extended finite state machines},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {729--740},
     publisher = {mathdoc},
     volume = {23},
     number = {6},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a4/}
}
TY  - JOUR
AU  - A. D. Ermakov
AU  - N. V. Yevtushenko
TI  - Deriving test suites with the guaranteed fault coverage for extended finite state machines
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2016
SP  - 729
EP  - 740
VL  - 23
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a4/
LA  - ru
ID  - MAIS_2016_23_6_a4
ER  - 
%0 Journal Article
%A A. D. Ermakov
%A N. V. Yevtushenko
%T Deriving test suites with the guaranteed fault coverage for extended finite state machines
%J Modelirovanie i analiz informacionnyh sistem
%D 2016
%P 729-740
%V 23
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a4/
%G ru
%F MAIS_2016_23_6_a4
A. D. Ermakov; N. V. Yevtushenko. Deriving test suites with the guaranteed fault coverage for extended finite state machines. Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 6, pp. 729-740. http://geodesic.mathdoc.fr/item/MAIS_2016_23_6_a4/

[1] Kaur M., Singh R., “A Review of Software Testing Techniques”, International Journal of Electronic and Electrical Engineering, 7:5 (2014), 463–474

[2] Jorgensen P. C., Software Testing: A Craftsman's Approach, Third Edition, Auerbach Publications, 2008, 440 pp. | Zbl

[3] Nica M., Nica S., Wotawa F., “On the use of mutations and testing for debugging”, Software – practice and experience, 43:9 (2013), 1121–1142 | DOI

[4] Nica S., On the Use of Constraints in Program Mutations and its Applicability to Testing, PhD thesis, Graz Technical University, 2013

[5] Petrenko A., Boroday S., Groz R., “Confirming Configurations in EFSM Testing”, IEEE Trans. Software Eng., 30:1 (2004), 29–42 | DOI

[6] El-Fakih K., Salameh T., Yevtushenko N., “On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment”, LNCS, 8763, 2014, 198–204

[7] $\mu$Java documentation, $\mu$Java home page, , 2014 (access date: 10.04.2016) http://cs.gmu.edu/õffutt/mujava/

[8] Villa, T. et al., The Unknown Component Problem: Theory and Applications, Springer, 2012, 313 pp. | Zbl

[9] Ermakov A., Yevtushenko N., “Increasing the fault coverage of tests derived against Extended Finite State Machines”, System informatics, 7 (2016), 23–32

[10] Alcalde B. et al., “Network Protocol System Passive Testing for Fault Management: A Backward Checking Approach”, Proc. of the 24th IFIP WG 6.1 Intern. Conf. on Formal Techniques for Networked and Distributed Systems, FORTE'2004, 150–166 | Zbl

[11] Kushik N. et al., “Optimizing Protocol Passive Testing through 'Gedanken' Experiments with Finite State Machines”, Proc. of the Intern conference on Sofware Quality and Reliability, QSR'2016 (August, 2016)

[12] Kushik N., Yenigün H., “Heuristics for Deriving Adaptive Homing and Distinguishing Sequences for Nondeterministic Finite State Machines”, Lecture Notes in Computer Science, 9447, 2015, 243–248 | DOI

[13] Kolomeec A. V., Algoritmy sinteza proverjajushhih testov dlja upravljajushhih sistem na osnove rasshirennyh avtomatov, Dis. ... kand. tekhn. nauk, Tomsk State University, 2010 (in Russian)

[14] Kushik N., Yevtushenko N., Cavalli A., “On Testing against Partial Non-observable Specifications”, Proc. of the Intern. Conf. on the Quality of Information and Communications Technology, 2014, 230–233

[15] Kushik N. et al., “On adaptive experiments for nondeterministic finite state machines”, The Intern. Journal on Software Tools for Technology Transfer, 18:3 (2016), 251–264 | DOI

[16] El-Fakih K. et al., “Distinguishing extended finite state machine configurations using predicate abstractions”, Journal on Software Research and Development, 2016 (published online)

[17] Mikhaylov Yu. V., Kolomeets A. V., “Proverka perekhodov v rasshirennom avtomate na osnove srezov”, Vestnik TGU. Seriya: Upravlenie, vychislitel'naya tekhnika i informatika, 3:4 (2008) (in Russian)

[18] JUnit 4, documentation, (access date: 10.04.2016) http://cs.gmu.edu/õffutt/mujava/