Chasing errors using biasing automata

Lei Bu; Doron Peled; Dashuan Shen; Yael Tzirulnikov

doi:10.1007/978-3-030-03421-4_18

Chasing errors using biasing automata

Lei Bu
, Doron Peled
, Dashuan Shen
, Yael Tzirulnikov

Department of Computer Science

Nanjing University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Randomized testing is a lightweight approach for searching for bugs. It presents a tradeoff between the number of testing experiments performed and the probability to find errors. An important challenge in random testing is when the errors that we try to detect are scattered with very low probability among the different executions, forming a “rare event”. We suggest here the use of a “biasing automaton”, which observes the tested sequence and controls the distribution of the different choices of extending it. By the careful selection of a biasing automaton, we can increase the chance of errors to be found and consequently reduce the number of tests we need to perform. The biasing automaton is constructed through repeated testing of variants of the system under test. We show how to construct biasing automata based on genetic programming.

Original language	English
Title of host publication	Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings
Editors	Tiziana Margaria, Bernhard Steffen
Publisher	Springer Verlag
Pages	271-286
Number of pages	16
ISBN (Print)	9783030034207
DOIs	https://doi.org/10.1007/978-3-030-03421-4_18
State	Published - 2018
Event	8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018 - Limassol, Cyprus Duration: 5 Nov 2018 → 9 Nov 2018

Publication series

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

Conference

Conference	8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018
Country/Territory	Cyprus
City	Limassol
Period	5/11/18 → 9/11/18

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.

Funding

The research in this paper was partially funded by an ISF-NSFC grant “Runtime Measuring and Checking of Cyber Physical Systems” (ISF award 2239/15, NSFC No. 61561146394). The authors from Nanjing University were also partially funded by a National Natural Science Foundation of China grant No. 61572249.

Funders	Funder number
ISF-NSFC
National Natural Science Foundation of China	61572249, 61561146394
Israel Science Foundation	2239/15

Access to Document

10.1007/978-3-030-03421-4_18

Cite this

Bu, L., Peled, D., Shen, D., & Tzirulnikov, Y. (2018). Chasing errors using biasing automata. In T. Margaria, & B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings (pp. 271-286). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11245 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03421-4_18

Bu, Lei ; Peled, Doron ; Shen, Dashuan et al. / Chasing errors using biasing automata. Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings. editor / Tiziana Margaria ; Bernhard Steffen. Springer Verlag, 2018. pp. 271-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1d55f1d2d73344fe8454f0ada2080c8a,

title = "Chasing errors using biasing automata",

abstract = "Randomized testing is a lightweight approach for searching for bugs. It presents a tradeoff between the number of testing experiments performed and the probability to find errors. An important challenge in random testing is when the errors that we try to detect are scattered with very low probability among the different executions, forming a “rare event”. We suggest here the use of a “biasing automaton”, which observes the tested sequence and controls the distribution of the different choices of extending it. By the careful selection of a biasing automaton, we can increase the chance of errors to be found and consequently reduce the number of tests we need to perform. The biasing automaton is constructed through repeated testing of variants of the system under test. We show how to construct biasing automata based on genetic programming.",

author = "Lei Bu and Doron Peled and Dashuan Shen and Yael Tzirulnikov",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018 ; Conference date: 05-11-2018 Through 09-11-2018",

year = "2018",

doi = "10.1007/978-3-030-03421-4\_18",

language = "אנגלית",

isbn = "9783030034207",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "271--286",

editor = "Tiziana Margaria and Bernhard Steffen",

booktitle = "Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings",

address = "גרמניה",

}

Bu, L, Peled, D, Shen, D & Tzirulnikov, Y 2018, Chasing errors using biasing automata. in T Margaria & B Steffen (eds), Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11245 LNCS, Springer Verlag, pp. 271-286, 8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018, Limassol, Cyprus, 5/11/18. https://doi.org/10.1007/978-3-030-03421-4_18

Chasing errors using biasing automata. / Bu, Lei; Peled, Doron; Shen, Dashuan et al.
Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings. ed. / Tiziana Margaria; Bernhard Steffen. Springer Verlag, 2018. p. 271-286 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11245 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Chasing errors using biasing automata

AU - Bu, Lei

AU - Peled, Doron

AU - Shen, Dashuan

AU - Tzirulnikov, Yael

PY - 2018

Y1 - 2018

N2 - Randomized testing is a lightweight approach for searching for bugs. It presents a tradeoff between the number of testing experiments performed and the probability to find errors. An important challenge in random testing is when the errors that we try to detect are scattered with very low probability among the different executions, forming a “rare event”. We suggest here the use of a “biasing automaton”, which observes the tested sequence and controls the distribution of the different choices of extending it. By the careful selection of a biasing automaton, we can increase the chance of errors to be found and consequently reduce the number of tests we need to perform. The biasing automaton is constructed through repeated testing of variants of the system under test. We show how to construct biasing automata based on genetic programming.

AB - Randomized testing is a lightweight approach for searching for bugs. It presents a tradeoff between the number of testing experiments performed and the probability to find errors. An important challenge in random testing is when the errors that we try to detect are scattered with very low probability among the different executions, forming a “rare event”. We suggest here the use of a “biasing automaton”, which observes the tested sequence and controls the distribution of the different choices of extending it. By the careful selection of a biasing automaton, we can increase the chance of errors to be found and consequently reduce the number of tests we need to perform. The biasing automaton is constructed through repeated testing of variants of the system under test. We show how to construct biasing automata based on genetic programming.

UR - https://www.scopus.com/pages/publications/85056451489

U2 - 10.1007/978-3-030-03421-4_18

DO - 10.1007/978-3-030-03421-4_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85056451489

SN - 9783030034207

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

SP - 271

EP - 286

BT - Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings

A2 - Margaria, Tiziana

A2 - Steffen, Bernhard

PB - Springer Verlag

T2 - 8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018

Y2 - 5 November 2018 through 9 November 2018

ER -

Bu L, Peled D, Shen D, Tzirulnikov Y. Chasing errors using biasing automata. In Margaria T, Steffen B, editors, Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Proceedings. Springer Verlag. 2018. p. 271-286. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03421-4_18

Chasing errors using biasing automata

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this