@INPROCEEDINGS{Sakti13-CPAIOR-ConstraintFitness,
   AUTHOR       = {Abdelilah Sakti and Yann-Ga�l Gu�h�neuc and 
      Gilles Pesant},
   BOOKTITLE    = {Proceedings of the 10<sup>th</sup> International Conference on Integration of Artificial Intelligence and Operations Research in Constraint Programming (CPAIOR)},
   TITLE        = {Constraint-based Fitness Function for Search-Based 
      Software Testing},
   YEAR         = {2013},
   OPTADDRESS   = {},
   OPTCROSSREF  = {},
   EDITOR       = {Carla Gomes and Meinolf Sellmann},
   MONTH        = {May},
   NOTE         = {4 pages. Short paper.},
   OPTNUMBER    = {},
   OPTORGANIZATION = {},
   PAGES        = {378--385},
   PUBLISHER    = {Springer},
   OPTSERIES    = {},
   OPTVOLUME    = {},
   KEYWORDS     = {Topic: <b>Test case generation</b>, 
      Venue: <c>CPAIOR</c>},
   URL          = {http://www.ptidej.net/publications/documents/CPAIOR13.doc.pdf},
   PDF          = {http://www.ptidej.net/publications/documents/CPAIOR13.ppt.pdf},
   ABSTRACT     = {Evolutionary testing approach is a powerful automated 
      technique for generating test inputs. Its goal is to reach a branch 
      or a statement in a program under test. One major limit of this 
      approach is its fitness function that does not offer enough 
      information to orient the search to reach a test target with the 
      existence of nested predicates. To address the problem, we propose a 
      new fitness function based on constraint programming. The level of 
      difficulty to satisfy a constraint is the main factor for ranking 
      test candidates: We modulate predicates as a constraint satisfaction 
      problem, then the difficulty-level of a constraint is determined 
      according to the its impact on the search space. Difficulty level is 
      a novel fitness function have been designed to deal with nested 
      predicates and its usefulness have been improved based on benchmarks 
      from the literature.}
}

{"_id":"7E6Zr6kARfdu2Pqi9","bibbaseid":"sakti-guhneuc-pesant-constraintbasedfitnessfunctionforsearchbasedsoftwaretesting-2013","downloads":0,"creationDate":"2018-01-17T20:29:42.321Z","title":"Constraint-based Fitness Function for Search-Based Software Testing","author_short":["Sakti, A.","Gu�h�neuc, Y.","Pesant, G."],"year":2013,"bibtype":"inproceedings","biburl":"http://www.yann-gael.gueheneuc.net/Work/Publications/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Abdelilah"],"propositions":[],"lastnames":["Sakti"],"suffixes":[]},{"firstnames":["Yann-Ga�l"],"propositions":[],"lastnames":["Gu�h�neuc"],"suffixes":[]},{"firstnames":["Gilles"],"propositions":[],"lastnames":["Pesant"],"suffixes":[]}],"booktitle":"Proceedings of the 10^th International Conference on Integration of Artificial Intelligence and Operations Research in Constraint Programming (CPAIOR)","title":"Constraint-based Fitness Function for Search-Based Software Testing","year":"2013","optaddress":"","optcrossref":"","editor":[{"firstnames":["Carla"],"propositions":[],"lastnames":["Gomes"],"suffixes":[]},{"firstnames":["Meinolf"],"propositions":[],"lastnames":["Sellmann"],"suffixes":[]}],"month":"May","note":"4 pages. Short paper.","optnumber":"","optorganization":"","pages":"378–385","publisher":"Springer","optseries":"","optvolume":"","keywords":"Topic: <b>Test case generation</b>, Venue: <c>CPAIOR</c>","url":"http://www.ptidej.net/publications/documents/CPAIOR13.doc.pdf","pdf":"http://www.ptidej.net/publications/documents/CPAIOR13.ppt.pdf","abstract":"Evolutionary testing approach is a powerful automated technique for generating test inputs. Its goal is to reach a branch or a statement in a program under test. One major limit of this approach is its fitness function that does not offer enough information to orient the search to reach a test target with the existence of nested predicates. To address the problem, we propose a new fitness function based on constraint programming. The level of difficulty to satisfy a constraint is the main factor for ranking test candidates: We modulate predicates as a constraint satisfaction problem, then the difficulty-level of a constraint is determined according to the its impact on the search space. Difficulty level is a novel fitness function have been designed to deal with nested predicates and its usefulness have been improved based on benchmarks from the literature.","bibtex":"@INPROCEEDINGS{Sakti13-CPAIOR-ConstraintFitness,\r\n AUTHOR = {Abdelilah Sakti and Yann-Ga�l Gu�h�neuc and \r\n Gilles Pesant},\r\n BOOKTITLE = {Proceedings of the 10^th International Conference on Integration of Artificial Intelligence and Operations Research in Constraint Programming (CPAIOR)},\r\n TITLE = {Constraint-based Fitness Function for Search-Based \r\n Software Testing},\r\n YEAR = {2013},\r\n OPTADDRESS = {},\r\n OPTCROSSREF = {},\r\n EDITOR = {Carla Gomes and Meinolf Sellmann},\r\n MONTH = {May},\r\n NOTE = {4 pages. Short paper.},\r\n OPTNUMBER = {},\r\n OPTORGANIZATION = {},\r\n PAGES = {378--385},\r\n PUBLISHER = {Springer},\r\n OPTSERIES = {},\r\n OPTVOLUME = {},\r\n KEYWORDS = {Topic: <b>Test case generation</b>, \r\n Venue: <c>CPAIOR</c>},\r\n URL = {http://www.ptidej.net/publications/documents/CPAIOR13.doc.pdf},\r\n PDF = {http://www.ptidej.net/publications/documents/CPAIOR13.ppt.pdf},\r\n ABSTRACT = {Evolutionary testing approach is a powerful automated \r\n technique for generating test inputs. Its goal is to reach a branch \r\n or a statement in a program under test. One major limit of this \r\n approach is its fitness function that does not offer enough \r\n information to orient the search to reach a test target with the \r\n existence of nested predicates. To address the problem, we propose a \r\n new fitness function based on constraint programming. The level of \r\n difficulty to satisfy a constraint is the main factor for ranking \r\n test candidates: We modulate predicates as a constraint satisfaction \r\n problem, then the difficulty-level of a constraint is determined \r\n according to the its impact on the search space. Difficulty level is \r\n a novel fitness function have been designed to deal with nested \r\n predicates and its usefulness have been improved based on benchmarks \r\n from the literature.}\r\n}\r\n\r\n","author_short":["Sakti, A.","Gu�h�neuc, Y.","Pesant, G."],"editor_short":["Gomes, C.","Sellmann, M."],"key":"Sakti13-CPAIOR-ConstraintFitness","id":"Sakti13-CPAIOR-ConstraintFitness","bibbaseid":"sakti-guhneuc-pesant-constraintbasedfitnessfunctionforsearchbasedsoftwaretesting-2013","role":"author","urls":{"Paper":"http://www.ptidej.net/publications/documents/CPAIOR13.doc.pdf"},"keyword":["Topic: <b>Test case generation</b>","Venue: <c>CPAIOR</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":"https://bibbase.org/show?bib=http://www.yann-gael.gueheneuc.net/Work/BibBase/guehene%20(automatically%20cleaned).bib"}},"downloads":0},"search_terms":["constraint","based","fitness","function","search","based","software","testing","sakti","gu�h�neuc","pesant"],"keywords":["topic: <b>test case generation</b>","venue: <c>cpaior</c>"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}