Finding the shortest path to reproduce a failure found by TESTAR

Olivia Rodriguez Valdes

doi:10.1145/3338906.3342496

Finding the shortest path to reproduce a failure found by TESTAR

Research Program Learning and Innovation in Resilient systems (LIRS)

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

Abstract

TESTAR is a tool for automated testing via the GUI. It uses dynamic analysis during automated GUI exploration and generates the test sequences during the execution. TESTAR saves all kind of information about the tests in a Graph database that can be queried or traversed during or after the tests using a traversal language. Test sequences leading to a failure can be excessively long, making the root-cause analysis of the failure difficult. This paper proposes an initial approach to find the shortest path to reproduce an error found by TESTAR

Original language	English
Title of host publication	Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering
Editors	Marlon Dumas, Dietmar Pfahl
Place of Publication	New York, USA
Publisher	Association for Computing Machinery
Pages	1223-1225
ISBN (Print)	978-1-4503-5572-8
DOIs	https://doi.org/10.1145/3338906.3342496
Publication status	Published - Aug 2019
Event	27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - Talinn, Estonia Duration: 26 Aug 2019 → 30 Aug 2019 Conference number: 27 https://esec-fse19.ut.ee/

Conference

Conference	27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering
Abbreviated title	ESEC/FSE 2019
Country/Territory	Estonia
City	Talinn
Period	26/08/19 → 30/08/19
Internet address	https://esec-fse19.ut.ee/

Keywords

Automated testing
TESTAR
root-cause analysis
flaky test
metaheuristic

Access to Document

10.1145/3338906.3342496

Cite this

@inproceedings{dade971300d84b9da56a426f5bfbd8b1,

title = "Finding the shortest path to reproduce a failure found by TESTAR",

abstract = "TESTAR is a tool for automated testing via the GUI. It uses dynamic analysis during automated GUI exploration and generates the test sequences during the execution. TESTAR saves all kind of information about the tests in a Graph database that can be queried or traversed during or after the tests using a traversal language. Test sequences leading to a failure can be excessively long, making the root-cause analysis of the failure difficult. This paper proposes an initial approach to find the shortest path to reproduce an error found by TESTAR",

keywords = "Automated testing, TESTAR, root-cause analysis, flaky test, metaheuristic",

author = "Valdes, {Olivia Rodriguez}",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/FSE 2019 ; Conference date: 26-08-2019 Through 30-08-2019",

year = "2019",

month = aug,

doi = "10.1145/3338906.3342496",

language = "English",

isbn = "978-1-4503-5572-8",

pages = "1223--1225",

editor = "Marlon Dumas and Dietmar Pfahl",

booktitle = "Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering",

publisher = "Association for Computing Machinery",

address = "United States",

url = "https://esec-fse19.ut.ee/",

}

Valdes, OR 2019, Finding the shortest path to reproduce a failure found by TESTAR. in M Dumas & D Pfahl (eds), Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. Association for Computing Machinery, New York, USA, pp. 1223-1225, 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Talinn, Estonia, 26/08/19. https://doi.org/10.1145/3338906.3342496

Finding the shortest path to reproduce a failure found by TESTAR. / Valdes, Olivia Rodriguez.
Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. ed. / Marlon Dumas; Dietmar Pfahl. New York, USA: Association for Computing Machinery, 2019. p. 1223-1225.

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

TY - GEN

T1 - Finding the shortest path to reproduce a failure found by TESTAR

AU - Valdes, Olivia Rodriguez

N1 - Conference code: 27

PY - 2019/8

Y1 - 2019/8

N2 - TESTAR is a tool for automated testing via the GUI. It uses dynamic analysis during automated GUI exploration and generates the test sequences during the execution. TESTAR saves all kind of information about the tests in a Graph database that can be queried or traversed during or after the tests using a traversal language. Test sequences leading to a failure can be excessively long, making the root-cause analysis of the failure difficult. This paper proposes an initial approach to find the shortest path to reproduce an error found by TESTAR

AB - TESTAR is a tool for automated testing via the GUI. It uses dynamic analysis during automated GUI exploration and generates the test sequences during the execution. TESTAR saves all kind of information about the tests in a Graph database that can be queried or traversed during or after the tests using a traversal language. Test sequences leading to a failure can be excessively long, making the root-cause analysis of the failure difficult. This paper proposes an initial approach to find the shortest path to reproduce an error found by TESTAR

KW - Automated testing

KW - TESTAR

KW - root-cause analysis

KW - flaky test

KW - metaheuristic

U2 - 10.1145/3338906.3342496

DO - 10.1145/3338906.3342496

M3 - Conference Article in proceeding

SN - 978-1-4503-5572-8

SP - 1223

EP - 1225

BT - Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering

A2 - Dumas, Marlon

A2 - Pfahl, Dietmar

PB - Association for Computing Machinery

CY - New York, USA

T2 - 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering

Y2 - 26 August 2019 through 30 August 2019

ER -

Finding the shortest path to reproduce a failure found by TESTAR

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this