A comparison of three black-box optimization approaches to model-based testing

Teemu Kanstrén, Marsha Chechik

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)

Abstract

Model-based testing is a technique for generating test cases from a test model. Various notations and techniques have been used to express the test model and generate test cases from those models. Many use customized modelling languages and in-depth white-box static analysis for test generation. This allows for optimizing generated tests to specific paths in the model. Others use general-purpose programming languages and light-weight black-box dynamic analysis. While this light-weight approach allows for quick prototyping and easier integration with existing tools and user skills, optimizing the resulting test suite becomes more challenging since less information about the possible paths is available. In this paper, we present and compare three approaches to such black-box optimization.
Original languageEnglish
Title of host publicationProceedings of the 2014 Federated Conference on Computer Science and Information Systems
PublisherInstitute of Electrical and Electronic Engineers IEEE
Pages1591-1598
Volume2
ISBN (Print)978-83-60810-58-3
DOIs
Publication statusPublished - 2014
MoE publication typeA4 Article in a conference publication
EventFederated Conference on Computer Science and Information Systems, FedCSIS - Warsaw, Poland
Duration: 7 Sep 201410 Sep 2014

Conference

ConferenceFederated Conference on Computer Science and Information Systems, FedCSIS
Abbreviated titleFedCSIS
CountryPoland
CityWarsaw
Period7/09/1410/09/14

Fingerprint

Testing
Static analysis
Computer programming languages
Dynamic analysis
Modeling languages

Keywords

  • algorithm design and analysis
  • analytical models
  • generators
  • greedy algorithms
  • optimization
  • radiation detectors
  • testing

Cite this

Kanstrén, T., & Chechik, M. (2014). A comparison of three black-box optimization approaches to model-based testing. In Proceedings of the 2014 Federated Conference on Computer Science and Information Systems (Vol. 2, pp. 1591-1598). Institute of Electrical and Electronic Engineers IEEE. https://doi.org/10.15439/2014F152
Kanstrén, Teemu ; Chechik, Marsha. / A comparison of three black-box optimization approaches to model-based testing. Proceedings of the 2014 Federated Conference on Computer Science and Information Systems. Vol. 2 Institute of Electrical and Electronic Engineers IEEE, 2014. pp. 1591-1598
@inproceedings{3673e26fe1a5445eb28c6790ad13f5c0,
title = "A comparison of three black-box optimization approaches to model-based testing",
abstract = "Model-based testing is a technique for generating test cases from a test model. Various notations and techniques have been used to express the test model and generate test cases from those models. Many use customized modelling languages and in-depth white-box static analysis for test generation. This allows for optimizing generated tests to specific paths in the model. Others use general-purpose programming languages and light-weight black-box dynamic analysis. While this light-weight approach allows for quick prototyping and easier integration with existing tools and user skills, optimizing the resulting test suite becomes more challenging since less information about the possible paths is available. In this paper, we present and compare three approaches to such black-box optimization.",
keywords = "algorithm design and analysis, analytical models, generators, greedy algorithms, optimization, radiation detectors, testing",
author = "Teemu Kanstr{\'e}n and Marsha Chechik",
year = "2014",
doi = "10.15439/2014F152",
language = "English",
isbn = "978-83-60810-58-3",
volume = "2",
pages = "1591--1598",
booktitle = "Proceedings of the 2014 Federated Conference on Computer Science and Information Systems",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
address = "United States",

}

Kanstrén, T & Chechik, M 2014, A comparison of three black-box optimization approaches to model-based testing. in Proceedings of the 2014 Federated Conference on Computer Science and Information Systems. vol. 2, Institute of Electrical and Electronic Engineers IEEE, pp. 1591-1598, Federated Conference on Computer Science and Information Systems, FedCSIS, Warsaw, Poland, 7/09/14. https://doi.org/10.15439/2014F152

A comparison of three black-box optimization approaches to model-based testing. / Kanstrén, Teemu; Chechik, Marsha.

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems. Vol. 2 Institute of Electrical and Electronic Engineers IEEE, 2014. p. 1591-1598.

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - A comparison of three black-box optimization approaches to model-based testing

AU - Kanstrén, Teemu

AU - Chechik, Marsha

PY - 2014

Y1 - 2014

N2 - Model-based testing is a technique for generating test cases from a test model. Various notations and techniques have been used to express the test model and generate test cases from those models. Many use customized modelling languages and in-depth white-box static analysis for test generation. This allows for optimizing generated tests to specific paths in the model. Others use general-purpose programming languages and light-weight black-box dynamic analysis. While this light-weight approach allows for quick prototyping and easier integration with existing tools and user skills, optimizing the resulting test suite becomes more challenging since less information about the possible paths is available. In this paper, we present and compare three approaches to such black-box optimization.

AB - Model-based testing is a technique for generating test cases from a test model. Various notations and techniques have been used to express the test model and generate test cases from those models. Many use customized modelling languages and in-depth white-box static analysis for test generation. This allows for optimizing generated tests to specific paths in the model. Others use general-purpose programming languages and light-weight black-box dynamic analysis. While this light-weight approach allows for quick prototyping and easier integration with existing tools and user skills, optimizing the resulting test suite becomes more challenging since less information about the possible paths is available. In this paper, we present and compare three approaches to such black-box optimization.

KW - algorithm design and analysis

KW - analytical models

KW - generators

KW - greedy algorithms

KW - optimization

KW - radiation detectors

KW - testing

U2 - 10.15439/2014F152

DO - 10.15439/2014F152

M3 - Conference article in proceedings

SN - 978-83-60810-58-3

VL - 2

SP - 1591

EP - 1598

BT - Proceedings of the 2014 Federated Conference on Computer Science and Information Systems

PB - Institute of Electrical and Electronic Engineers IEEE

ER -

Kanstrén T, Chechik M. A comparison of three black-box optimization approaches to model-based testing. In Proceedings of the 2014 Federated Conference on Computer Science and Information Systems. Vol. 2. Institute of Electrical and Electronic Engineers IEEE. 2014. p. 1591-1598 https://doi.org/10.15439/2014F152