SBFR: A search based approach for reproducing failures of programs with grammar based input

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Kifetew:2013:ASE,

• author = "Fitsum Meshesha Kifetew and Wei Jin and Roberto Tiella and Alessandro Orso and Paolo Tonella",
• title = "{SBFR}: A search based approach for reproducing failures of programs with grammar based input",
• booktitle = "28th IEEE/ACM International Conference on Automated Software Engineering (ASE 2013)",
• year = "2013",
• month = "11-15 " # nov,
• pages = "604--609",
• note = "new ideas track",
• keywords = "genetic algorithms, genetic programming, SBSE",
• DOI = "doi:10.1109/ASE.2013.6693120",
• abstract = "Reproducing field failures in-house, a step developers must perform when assigned a bug report, is an arduous task. In most cases, developers must be able to reproduce a reported failure using only a stack trace and/or some informal description of the failure. The problem becomes even harder for the large class of programs whose input is highly structured and strictly specified by a grammar. To address this problem, we present SBFR, a search-based failure-reproduction technique for programs with structured input. SBFR formulates failure reproduction as a search problem. Starting from a reported failure and a limited amount of dynamic information about the failure, SBFR exploits the potential of genetic programming to iteratively find legal inputs that can trigger the failure.",
• notes = "Also known as \cite{6693120}",

}

Genetic Programming entries for Fitsum Meshesha Kifetew Wei Jin Roberto Tiella Alessandro Orso Paolo Tonella

Citations