A bounded incremental test generation algorithm for finite state machines

Zoltán Pap, Mahadevan Subramaniam, Gábor Kovács, Gábor Árpád Németh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models. Our approach, in contrast to the traditional view, is based on the observation that system specifications are in most cases modified incrementally in practice as requirements evolve. We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current - modified - system. We use a widely accepted framework to evaluate the complexity of the proposed incremental algorithm, and show that it is a function of the size of the change in the specification rather than the size of the specification itself. Thus, the method is very efficient in the case of small changes, and never performs worse than the relevant traditional algorithm - the HIS-method. We also demonstrate our algorithm through an example.

Original languageEnglish (US)
Title of host publicationTesting of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings
Pages244-259
Number of pages16
StatePublished - Aug 27 2007
Event19th IFIP TC6/WG6.1 International Conference on Testing of Communicating Systems, Testcom 2007, and 7th International Workshop on Formal Approaches to Testing Software, FATES 2007 - Tallinn, Estonia
Duration: Jun 26 2007Jun 29 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4581 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th IFIP TC6/WG6.1 International Conference on Testing of Communicating Systems, Testcom 2007, and 7th International Workshop on Formal Approaches to Testing Software, FATES 2007
CountryEstonia
CityTallinn
Period6/26/076/29/07

Fingerprint

Test Generation
Finite automata
State Machine
Incremental Algorithm
Specification
Specifications
Test Set
Evaluate
Requirements
Demonstrate
Model

Keywords

  • Conformance testing
  • Finite state machine
  • Incremental algorithms
  • Test generation algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Pap, Z., Subramaniam, M., Kovács, G., & Németh, G. Á. (2007). A bounded incremental test generation algorithm for finite state machines. In Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings (pp. 244-259). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4581 LNCS).

A bounded incremental test generation algorithm for finite state machines. / Pap, Zoltán; Subramaniam, Mahadevan; Kovács, Gábor; Németh, Gábor Árpád.

Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings. 2007. p. 244-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4581 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pap, Z, Subramaniam, M, Kovács, G & Németh, GÁ 2007, A bounded incremental test generation algorithm for finite state machines. in Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4581 LNCS, pp. 244-259, 19th IFIP TC6/WG6.1 International Conference on Testing of Communicating Systems, Testcom 2007, and 7th International Workshop on Formal Approaches to Testing Software, FATES 2007, Tallinn, Estonia, 6/26/07.
Pap Z, Subramaniam M, Kovács G, Németh GÁ. A bounded incremental test generation algorithm for finite state machines. In Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings. 2007. p. 244-259. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Pap, Zoltán ; Subramaniam, Mahadevan ; Kovács, Gábor ; Németh, Gábor Árpád. / A bounded incremental test generation algorithm for finite state machines. Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings. 2007. pp. 244-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d729a217ea8c41729a7942f6b734b7f1,
title = "A bounded incremental test generation algorithm for finite state machines",
abstract = "We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models. Our approach, in contrast to the traditional view, is based on the observation that system specifications are in most cases modified incrementally in practice as requirements evolve. We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current - modified - system. We use a widely accepted framework to evaluate the complexity of the proposed incremental algorithm, and show that it is a function of the size of the change in the specification rather than the size of the specification itself. Thus, the method is very efficient in the case of small changes, and never performs worse than the relevant traditional algorithm - the HIS-method. We also demonstrate our algorithm through an example.",
keywords = "Conformance testing, Finite state machine, Incremental algorithms, Test generation algorithms",
author = "Zolt{\'a}n Pap and Mahadevan Subramaniam and G{\'a}bor Kov{\'a}cs and N{\'e}meth, {G{\'a}bor {\'A}rp{\'a}d}",
year = "2007",
month = "8",
day = "27",
language = "English (US)",
isbn = "3540730656",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "244--259",
booktitle = "Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings",

}

TY - GEN

T1 - A bounded incremental test generation algorithm for finite state machines

AU - Pap, Zoltán

AU - Subramaniam, Mahadevan

AU - Kovács, Gábor

AU - Németh, Gábor Árpád

PY - 2007/8/27

Y1 - 2007/8/27

N2 - We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models. Our approach, in contrast to the traditional view, is based on the observation that system specifications are in most cases modified incrementally in practice as requirements evolve. We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current - modified - system. We use a widely accepted framework to evaluate the complexity of the proposed incremental algorithm, and show that it is a function of the size of the change in the specification rather than the size of the specification itself. Thus, the method is very efficient in the case of small changes, and never performs worse than the relevant traditional algorithm - the HIS-method. We also demonstrate our algorithm through an example.

AB - We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models. Our approach, in contrast to the traditional view, is based on the observation that system specifications are in most cases modified incrementally in practice as requirements evolve. We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current - modified - system. We use a widely accepted framework to evaluate the complexity of the proposed incremental algorithm, and show that it is a function of the size of the change in the specification rather than the size of the specification itself. Thus, the method is very efficient in the case of small changes, and never performs worse than the relevant traditional algorithm - the HIS-method. We also demonstrate our algorithm through an example.

KW - Conformance testing

KW - Finite state machine

KW - Incremental algorithms

KW - Test generation algorithms

UR - http://www.scopus.com/inward/record.url?scp=34548078768&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548078768&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540730656

SN - 9783540730651

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 244

EP - 259

BT - Testing of Software and Communicating Systems - 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Proceedings

ER -