Classifying test suite effectiveness via model inference and ROBBDs

Hermann Felbinger, Ingo Pill, Franz Wotawa

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

Abstract

Deciding whether a given test suite is effective enough is certainly a challenging task. Focusing on a software program’s functionality, we propose in this paper a new method that leverages Boolean functions as abstract reasoning format. That is, we use machine learning in order to infer a special binary decision diagram from the considered test suite and extract a total variable order, if possible. Intuitively, if an ROBDD derived from the Boolean functions representing the program under test’s specification actually coincides with that of the test suite (using the same variable order), we conclude that the test suite is effective enough. That is, any program that passes such a test suite should clearly show the desired input-output behavior. In our paper, we provide the corresponding algorithms of our approach and their respective proofs. Our first experimental results illustrate our approach’s practicality and viability.

Original languageEnglish
Title of host publicationTests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings
PublisherSpringer-Verlag Italia
Pages76-93
Number of pages18
Volume9762
ISBN (Print)9783319411347
DOIs
Publication statusPublished - 2016
Event10th International Conference on Tests and Proofs, TAP 2016 and Held as Part of Software Technologies: Applications and Foundations, STAF 2016 - Vienna, Austria
Duration: 5 Jul 20167 Jul 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9762
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference10th International Conference on Tests and Proofs, TAP 2016 and Held as Part of Software Technologies: Applications and Foundations, STAF 2016
CountryAustria
CityVienna
Period5/07/167/07/16

Fingerprint

Boolean functions
Binary decision diagrams
Learning systems
Boolean Functions
Specifications
Specification Test
Model
Decision Diagrams
Viability
Leverage
Machine Learning
Reasoning
Binary
Software
Output
Experimental Results

Keywords

  • BDD
  • Machine learning
  • ROBDD
  • Software testing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Felbinger, H., Pill, I., & Wotawa, F. (2016). Classifying test suite effectiveness via model inference and ROBBDs. In Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings (Vol. 9762, pp. 76-93). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9762). Springer-Verlag Italia. https://doi.org/10.1007/978-3-319-41135-4_5

Classifying test suite effectiveness via model inference and ROBBDs. / Felbinger, Hermann; Pill, Ingo; Wotawa, Franz.

Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings. Vol. 9762 Springer-Verlag Italia, 2016. p. 76-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9762).

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

Felbinger, H, Pill, I & Wotawa, F 2016, Classifying test suite effectiveness via model inference and ROBBDs. in Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings. vol. 9762, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9762, Springer-Verlag Italia, pp. 76-93, 10th International Conference on Tests and Proofs, TAP 2016 and Held as Part of Software Technologies: Applications and Foundations, STAF 2016, Vienna, Austria, 5/07/16. https://doi.org/10.1007/978-3-319-41135-4_5
Felbinger H, Pill I, Wotawa F. Classifying test suite effectiveness via model inference and ROBBDs. In Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings. Vol. 9762. Springer-Verlag Italia. 2016. p. 76-93. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-41135-4_5
Felbinger, Hermann ; Pill, Ingo ; Wotawa, Franz. / Classifying test suite effectiveness via model inference and ROBBDs. Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings. Vol. 9762 Springer-Verlag Italia, 2016. pp. 76-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{638163ad3d344d6392c3116dab6dea59,
title = "Classifying test suite effectiveness via model inference and ROBBDs",
abstract = "Deciding whether a given test suite is effective enough is certainly a challenging task. Focusing on a software program’s functionality, we propose in this paper a new method that leverages Boolean functions as abstract reasoning format. That is, we use machine learning in order to infer a special binary decision diagram from the considered test suite and extract a total variable order, if possible. Intuitively, if an ROBDD derived from the Boolean functions representing the program under test’s specification actually coincides with that of the test suite (using the same variable order), we conclude that the test suite is effective enough. That is, any program that passes such a test suite should clearly show the desired input-output behavior. In our paper, we provide the corresponding algorithms of our approach and their respective proofs. Our first experimental results illustrate our approach’s practicality and viability.",
keywords = "BDD, Machine learning, ROBDD, Software testing, Testing",
author = "Hermann Felbinger and Ingo Pill and Franz Wotawa",
year = "2016",
doi = "10.1007/978-3-319-41135-4_5",
language = "English",
isbn = "9783319411347",
volume = "9762",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag Italia",
pages = "76--93",
booktitle = "Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings",
address = "Italy",

}

TY - GEN

T1 - Classifying test suite effectiveness via model inference and ROBBDs

AU - Felbinger, Hermann

AU - Pill, Ingo

AU - Wotawa, Franz

PY - 2016

Y1 - 2016

N2 - Deciding whether a given test suite is effective enough is certainly a challenging task. Focusing on a software program’s functionality, we propose in this paper a new method that leverages Boolean functions as abstract reasoning format. That is, we use machine learning in order to infer a special binary decision diagram from the considered test suite and extract a total variable order, if possible. Intuitively, if an ROBDD derived from the Boolean functions representing the program under test’s specification actually coincides with that of the test suite (using the same variable order), we conclude that the test suite is effective enough. That is, any program that passes such a test suite should clearly show the desired input-output behavior. In our paper, we provide the corresponding algorithms of our approach and their respective proofs. Our first experimental results illustrate our approach’s practicality and viability.

AB - Deciding whether a given test suite is effective enough is certainly a challenging task. Focusing on a software program’s functionality, we propose in this paper a new method that leverages Boolean functions as abstract reasoning format. That is, we use machine learning in order to infer a special binary decision diagram from the considered test suite and extract a total variable order, if possible. Intuitively, if an ROBDD derived from the Boolean functions representing the program under test’s specification actually coincides with that of the test suite (using the same variable order), we conclude that the test suite is effective enough. That is, any program that passes such a test suite should clearly show the desired input-output behavior. In our paper, we provide the corresponding algorithms of our approach and their respective proofs. Our first experimental results illustrate our approach’s practicality and viability.

KW - BDD

KW - Machine learning

KW - ROBDD

KW - Software testing

KW - Testing

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

U2 - 10.1007/978-3-319-41135-4_5

DO - 10.1007/978-3-319-41135-4_5

M3 - Conference contribution

SN - 9783319411347

VL - 9762

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

SP - 76

EP - 93

BT - Tests and Proofs - 10th International Conference, TAP 2016 Held as Part of STAF 2016, Proceedings

PB - Springer-Verlag Italia

ER -