Divide-by-zero Exceptions Raising via Branch Coverage. Bhattacharya, N., Sakti, A., Antoniol, G., Gu�h�neuc, Y., & Pesant, G. In Cohen, M. & Cinn�ide, M. �, editors, Proceedings of the 3<sup>rd</sup> International Symposium on Search-based Software Engineering (SSBSE), pages 204–218, September, 2011. IEEE CS Press. 10 pages.
![Divide-by-zero Exceptions Raising via Branch Coverage [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper abstract bibtex
Paper abstract bibtex In this paper, we discuss how a search-based branch coverage approach can be used to design an effective test data generation approach, specifically targeting divide-by-zero exceptions. We first propose a novel additive fitness function combining \emphapproach level and \emphbranch distance. We then use different search strategies, ıe hill climbing, simulated annealing, and genetic algorithm, to evaluate the performance of the novel fitness function on a small synthetic example as well as on methods known to throw divide-by-zero exceptions, extracted from real world systems, namely Eclipse and Android. Finally, we also describe how the test data generation for divide-by-zero exceptions can be formulated as a constraint programming problem and compare the resolution of this problem with a genetic algorithm in terms of execution time. We thus report evidence that genetic algorithm using our novel fitness function out-performs hill climbing and simulated annealing and a previous approach (in terms of numbers of fitness evaluation) but is out-performed by constraint programming (in terms of execution time).
@INPROCEEDINGS{Bhattacharya11-SSBSE-DivideByZero,
AUTHOR = {Neelesh Bhattacharya and Abdelilah Sakti and
Giuliano Antoniol and Yann-Ga�l Gu�h�neuc and Gilles Pesant},
BOOKTITLE = {Proceedings of the 3<sup>rd</sup> International Symposium on Search-based Software Engineering (SSBSE)},
TITLE = {Divide-by-zero Exceptions Raising via Branch Coverage},
YEAR = {2011},
OPTADDRESS = {},
OPTCROSSREF = {},
EDITOR = {Myra Cohen and Mel � Cinn�ide},
MONTH = {September},
NOTE = {10 pages.},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {204--218},
PUBLISHER = {IEEE CS Press},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Topic: <b>Test case generation</b>, Venue: <c>SSBSE</c>},
URL = {http://www.ptidej.net/publications/documents/SSBSE11a.doc.pdf},
PDF = {http://www.ptidej.net/publications/documents/SSBSE11a.ppt.pdf},
ABSTRACT = {In this paper, we discuss how a search-based branch
coverage approach can be used to design an effective test data
generation approach, specifically targeting divide-by-zero
exceptions. We first propose a novel additive fitness function
combining \emph{approach level} and \emph{branch distance}. We then
use different search strategies, \ie{} hill climbing, simulated
annealing, and genetic algorithm, to evaluate the performance of the
novel fitness function on a small synthetic example as well as on
methods known to throw divide-by-zero exceptions, extracted from real
world systems, namely Eclipse and Android. Finally, we also describe
how the test data generation for divide-by-zero exceptions can be
formulated as a constraint programming problem and compare the
resolution of this problem with a genetic algorithm in terms of
execution time. We thus report evidence that genetic algorithm using
our novel fitness function out-performs hill climbing and simulated
annealing and a previous approach (in terms of numbers of fitness
evaluation) but is out-performed by constraint programming (in terms
of execution time).}
}Downloads: 0
{"_id":"5sFD5mynPXXAyXBB5","bibbaseid":"bhattacharya-sakti-antoniol-guhneuc-pesant-dividebyzeroexceptionsraisingviabranchcoverage-2011","downloads":0,"creationDate":"2018-01-17T20:29:42.422Z","title":"Divide-by-zero Exceptions Raising via Branch Coverage","author_short":["Bhattacharya, N.","Sakti, A.","Antoniol, G.","Gu�h�neuc, Y.","Pesant, G."],"year":2011,"bibtype":"inproceedings","biburl":"http://www.yann-gael.gueheneuc.net/Work/Publications/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Neelesh"],"propositions":[],"lastnames":["Bhattacharya"],"suffixes":[]},{"firstnames":["Abdelilah"],"propositions":[],"lastnames":["Sakti"],"suffixes":[]},{"firstnames":["Giuliano"],"propositions":[],"lastnames":["Antoniol"],"suffixes":[]},{"firstnames":["Yann-Ga�l"],"propositions":[],"lastnames":["Gu�h�neuc"],"suffixes":[]},{"firstnames":["Gilles"],"propositions":[],"lastnames":["Pesant"],"suffixes":[]}],"booktitle":"Proceedings of the 3<sup>rd</sup> International Symposium on Search-based Software Engineering (SSBSE)","title":"Divide-by-zero Exceptions Raising via Branch Coverage","year":"2011","optaddress":"","optcrossref":"","editor":[{"firstnames":["Myra"],"propositions":[],"lastnames":["Cohen"],"suffixes":[]},{"firstnames":["Mel","�"],"propositions":[],"lastnames":["Cinn�ide"],"suffixes":[]}],"month":"September","note":"10 pages.","optnumber":"","optorganization":"","pages":"204–218","publisher":"IEEE CS Press","optseries":"","optvolume":"","keywords":"Topic: <b>Test case generation</b>, Venue: <c>SSBSE</c>","url":"http://www.ptidej.net/publications/documents/SSBSE11a.doc.pdf","pdf":"http://www.ptidej.net/publications/documents/SSBSE11a.ppt.pdf","abstract":"In this paper, we discuss how a search-based branch coverage approach can be used to design an effective test data generation approach, specifically targeting divide-by-zero exceptions. We first propose a novel additive fitness function combining \\emphapproach level and \\emphbranch distance. We then use different search strategies, ıe hill climbing, simulated annealing, and genetic algorithm, to evaluate the performance of the novel fitness function on a small synthetic example as well as on methods known to throw divide-by-zero exceptions, extracted from real world systems, namely Eclipse and Android. Finally, we also describe how the test data generation for divide-by-zero exceptions can be formulated as a constraint programming problem and compare the resolution of this problem with a genetic algorithm in terms of execution time. We thus report evidence that genetic algorithm using our novel fitness function out-performs hill climbing and simulated annealing and a previous approach (in terms of numbers of fitness evaluation) but is out-performed by constraint programming (in terms of execution time).","bibtex":"@INPROCEEDINGS{Bhattacharya11-SSBSE-DivideByZero,\r\n AUTHOR = {Neelesh Bhattacharya and Abdelilah Sakti and \r\n Giuliano Antoniol and Yann-Ga�l Gu�h�neuc and Gilles Pesant},\r\n BOOKTITLE = {Proceedings of the 3<sup>rd</sup> International Symposium on Search-based Software Engineering (SSBSE)},\r\n TITLE = {Divide-by-zero Exceptions Raising via Branch Coverage},\r\n YEAR = {2011},\r\n OPTADDRESS = {},\r\n OPTCROSSREF = {},\r\n EDITOR = {Myra Cohen and Mel � Cinn�ide},\r\n MONTH = {September},\r\n NOTE = {10 pages.},\r\n OPTNUMBER = {},\r\n OPTORGANIZATION = {},\r\n PAGES = {204--218},\r\n PUBLISHER = {IEEE CS Press},\r\n OPTSERIES = {},\r\n OPTVOLUME = {},\r\n KEYWORDS = {Topic: <b>Test case generation</b>, Venue: <c>SSBSE</c>},\r\n URL = {http://www.ptidej.net/publications/documents/SSBSE11a.doc.pdf},\r\n PDF = {http://www.ptidej.net/publications/documents/SSBSE11a.ppt.pdf},\r\n ABSTRACT = {In this paper, we discuss how a search-based branch \r\n coverage approach can be used to design an effective test data \r\n generation approach, specifically targeting divide-by-zero \r\n exceptions. We first propose a novel additive fitness function \r\n combining \\emph{approach level} and \\emph{branch distance}. We then \r\n use different search strategies, \\ie{} hill climbing, simulated \r\n annealing, and genetic algorithm, to evaluate the performance of the \r\n novel fitness function on a small synthetic example as well as on \r\n methods known to throw divide-by-zero exceptions, extracted from real \r\n world systems, namely Eclipse and Android. Finally, we also describe \r\n how the test data generation for divide-by-zero exceptions can be \r\n formulated as a constraint programming problem and compare the \r\n resolution of this problem with a genetic algorithm in terms of \r\n execution time. We thus report evidence that genetic algorithm using \r\n our novel fitness function out-performs hill climbing and simulated \r\n annealing and a previous approach (in terms of numbers of fitness \r\n evaluation) but is out-performed by constraint programming (in terms \r\n of execution time).}\r\n}\r\n\r\n","author_short":["Bhattacharya, N.","Sakti, A.","Antoniol, G.","Gu�h�neuc, Y.","Pesant, G."],"editor_short":["Cohen, M.","Cinn�ide, M. �"],"key":"Bhattacharya11-SSBSE-DivideByZero","id":"Bhattacharya11-SSBSE-DivideByZero","bibbaseid":"bhattacharya-sakti-antoniol-guhneuc-pesant-dividebyzeroexceptionsraisingviabranchcoverage-2011","role":"author","urls":{"Paper":"http://www.ptidej.net/publications/documents/SSBSE11a.doc.pdf"},"keyword":["Topic: <b>Test case generation</b>","Venue: <c>SSBSE</c>"],"metadata":{"authorlinks":{"gu�h�neuc, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.yann-gael.gueheneuc.net%2FWork%2FPublications%2FBiblio%2Fcomplete-bibliography.bib&msg=embed","guéhéneuc, y":"http://www.yann-gael.gueheneuc.net/"}}},"search_terms":["divide","zero","exceptions","raising","via","branch","coverage","bhattacharya","sakti","antoniol","gu�h�neuc","pesant"],"keywords":["topic: <b>test case generation</b>","venue: <c>ssbse</c>"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}