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 Scopus citations

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

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).