Tree Preprocessing and Test Outcome Caching for Efficient Hierarchical Delta Debugging

Hodován, Renáta; Kiss, Ákos; Gyimóthy, Tibor

doi:10.1109/ast.2017.4

Cited by 15 publications

(22 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An artificial consumer of the input signals error for non-integer elements, and so the reduction criterion (i.e., the property to keep during reduction) is to keep the input as a valid JSON file, but also reproduce the error signal in the consumer. This test case was used as a motivating example in [10].…”

Section: A Test Inputs From the Literaturementioning

confidence: 99%

Generalizing the Split Factor of the Minimizing Delta Debugging Algorithm

Kiss

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Section: A Test Inputs From the Literaturementioning

confidence: 99%

Generalizing the Split Factor of the Minimizing Delta Debugging Algorithm

Kiss

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

“…A number of tools attempt to perform language-agnostic input reduction. The classic example of this is Picireny [23], an implementation of HDD. It performs HDD over the parse trees produced from an input ANTLR [24] grammar; if your input can be described with ANTLR, Picireny can try to reduce it.…”

Section: Related Workmentioning

confidence: 99%

ReduKtor: How We Stopped Worrying About Bugs in Kotlin Compiler

Stepanov

Akhin

Belyaev

2019

2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Bug localization is well-known to be a difficult problem in software engineering, and specifically in compiler development, where it is beneficial to reduce the input program to a minimal reproducing example; this technique is more commonly known as delta debugging. What additionally contributes to the problem is that every new programming language has its own unique quirks and foibles, making it near impossible to reuse existing tools and approaches with full efficiency. In this experience paper we tackle the delta debugging problem w.r.t. Kotlin, a relatively new programming language from JetBrains. Our approach is based on a novel combination of program slicing, hierarchical delta debugging and Kotlin-specific transformations, which are synergistic to each other. We implemented it in a prototype called ReduKtor and did extensive evaluation on both synthetic and real Kotlin programs; we also compared its performance with classic delta debugging techniques. The evaluation results support the practical usability of our approach to Kotlin delta debugging and also shows the importance of using both language-agnostic and language-specific techniques to achieve best reduction efficiency and performance.

show abstract

“…In the second part, two state-of-the-art automatic test case reduction approaches are analysed, their weaknesses are pinpointed and several improvements are proposed to them. The results, which are based on publications [45,44,48,47], are presented in Chapters 7, 8, 9, 10 respectively.…”

Section: Automatic Test Case Reductionmentioning

confidence: 99%

“…A második részben két modern automatikus teszteset-redukaló megközelítést analizáltunk, tártuk fel a gyenge pontjaikat és tettünk javaslatokat azok továbbfejlesztésére. Ezen eredményeket, melyek a [45,44,48,47] publikációkon alapszanak, a 7, 8, 9, 10 fejezetekben tárgyaltuk részleteiben.…”

Section: Listing 103 the Flatten Tree Recursion Algorithmunclassified

See 1 more Smart Citation

Fuzz Testing and Test Case Reduction

Hodován¹

View full text Add to dashboard Cite

When looking back on our lives, it is often hard to determine the point when our current path or profession was chosen. Some people say that they have always known what career they wanted to pursue, others made the decision right before the college application deadline, and there are those who are still uncertain whether they made the right choice even after getting a degree. As for me, the only thing I know for sure is that I have always been fascinated by movies about hackers, even by the not so good ones. I never truly believed that one day I was going to do something similar, but now, 20 years later, here I am. Hunting for issues, reporting security bugs, and writing my thesis. Over the years I slowly realized that nothing could be further from computer science than those movies. However, while sitting in front of my computer, I still often find myself imagine being the protagonist of such a story. And I start to believe that this is reality now. Getting here has been a long journey, but by no means a lonely one. Many people helped me along the way and I will always be grateful to them. Chronologically first, I would like to say thank you to my high school teachers, Zsuzsanna Bali and Imre Szőke, who persuaded me that girls could also become computer scientists. I am thankful to Tibor Gyimóthy who invited me to join the Department of Software Engineering many years ago and later became my Ph.D. supervisor. I am grateful to him and to Ákos Kiss for their continuous support, especially after I left the safe harbour by choosing a topic that has not had a long research history at our department. I am also thankful to Gábor Lóki and Zoltán Herczeg for putting my research into practice. Last but not least, I would like to thank my family that they provided a pleasant background to my studies throughout the years and also encouraged me to go on with my research.

show abstract

Tree Preprocessing and Test Outcome Caching for Efficient Hierarchical Delta Debugging

Cited by 15 publications

References 10 publications

Generalizing the Split Factor of the Minimizing Delta Debugging Algorithm

Generalizing the Split Factor of the Minimizing Delta Debugging Algorithm

ReduKtor: How We Stopped Worrying About Bugs in Kotlin Compiler

Fuzz Testing and Test Case Reduction

Contact Info

Product

Resources

About