{"id":"https://openalex.org/W2004071059","doi":"https://doi.org/10.1109/ase.2011.6100092","title":"Combining search-based and constraint-based testing","display_name":"Combining search-based and constraint-based testing","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2004071059","doi":"https://doi.org/10.1109/ase.2011.6100092","mag":"2004071059"},"language":"en","primary_location":{"id":"doi:10.1109/ase.2011.6100092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase.2011.6100092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085869832","display_name":"Jan Malburg","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Malburg","raw_affiliation_strings":["Computer Science, Saarland University, Saarbrucken, Germany","Saarland University Computer Science Saarbr\u00fccken Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Saarland University, Saarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland University Computer Science Saarbr\u00fccken Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079261847","display_name":"Gordon Fraser","orcid":"https://orcid.org/0000-0002-4364-6595"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gordon Fraser","raw_affiliation_strings":["Computer Science, Saarland University, Saarbrucken, Germany","Saarland University Computer Science Saarbr\u00fccken Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Saarland University, Saarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland University Computer Science Saarbr\u00fccken Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":12.1518,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.98839234,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"436","last_page":"439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6870229244232178},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6470645666122437},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5510313510894775},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5109288096427917},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5063730478286743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46958914399147034},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.44682377576828003},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4428720474243164},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.4369432330131531},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4240500032901764},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4146682918071747},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3530292809009552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35292255878448486},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3018936216831207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1953873634338379}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6870229244232178},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6470645666122437},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5510313510894775},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5109288096427917},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5063730478286743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46958914399147034},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.44682377576828003},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4428720474243164},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4369432330131531},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4240500032901764},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4146682918071747},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3530292809009552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35292255878448486},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3018936216831207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1953873634338379},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ase.2011.6100092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase.2011.6100092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323322","display_name":"Universit\u00e4t des Saarlandes","ror":"https://ror.org/01jdpyv68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W86973270","https://openalex.org/W413926619","https://openalex.org/W1640714309","https://openalex.org/W1777881387","https://openalex.org/W1971137495","https://openalex.org/W1988537734","https://openalex.org/W2012997183","https://openalex.org/W2020493640","https://openalex.org/W2029664558","https://openalex.org/W2096449544","https://openalex.org/W2104993088","https://openalex.org/W2110311336","https://openalex.org/W2114869486","https://openalex.org/W2122205205","https://openalex.org/W2122598528","https://openalex.org/W2142679626","https://openalex.org/W2169063148","https://openalex.org/W2171480813","https://openalex.org/W2293616642","https://openalex.org/W2741261446","https://openalex.org/W3149158604","https://openalex.org/W4213079124","https://openalex.org/W4237492309","https://openalex.org/W6676613598"],"related_works":["https://openalex.org/W2017710358","https://openalex.org/W2737098235","https://openalex.org/W2495408185","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W3195880842","https://openalex.org/W2141935412","https://openalex.org/W1540285992","https://openalex.org/W2604474157"],"abstract_inverted_index":{"Many":[0],"modern":[1],"automated":[2],"test":[3],"generators":[4],"are":[5],"based":[6],"on":[7,45,109,116],"either":[8],"meta-heuristic":[9],"search":[10,38],"techniques":[11,65,127],"or":[12],"use":[13],"constraint":[14,94],"solvers.":[15],"Both":[16],"approaches":[17],"have":[18,24],"their":[19],"advantages,":[20],"but":[21,86],"they":[22],"also":[23],"specific":[25],"drawbacks:":[26],"Search-based":[27],"methods":[28],"get":[29],"stuck":[30],"in":[31],"local":[32],"optima":[33],"and":[34,66,128],"degrade":[35],"when":[36],"the":[37,46,68,87,118],"landscape":[39],"offers":[40],"no":[41],"guidance;":[42],"constraint-based":[43,132],"approaches,":[44],"other":[47],"hand,":[48],"can":[49],"only":[50],"handle":[51],"certain":[52],"domains":[53],"efficiently.":[54],"In":[55],"this":[56],"paper":[57],"we":[58],"describe":[59],"a":[60,74,80,93],"method":[61,78],"that":[62,90,100,115],"integrates":[63],"both":[64,71],"delivers":[67],"best":[69],"of":[70],"worlds.":[72],"On":[73],"high-level":[75],"view,":[76],"our":[77],"uses":[79],"genetic":[81],"algorithm":[82],"to":[83,98],"generate":[84],"tests,":[85],"twist":[88],"is":[89,96],"during":[91],"evolution":[92],"solver":[95],"used":[97],"ensure":[99],"mutated":[101],"offspring":[102],"efficiently":[103],"explores":[104],"different":[105],"control":[106],"flow.":[107],"Experiments":[108],"20":[110],"case":[111],"study":[112],"examples":[113],"show":[114],"average":[117],"combination":[119],"improves":[120],"branch":[121],"coverage":[122],"by":[123,129],"28%":[124],"over":[125,131],"search-based":[126],"13%":[130],"techniques.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}