{"id":"https://openalex.org/W3212956295","doi":"https://doi.org/10.32604/iasc.2022.022335","title":"Crow Search Algorithm with Improved Objective Function for Test Case Generation and Optimization","display_name":"Crow Search Algorithm with Improved Objective Function for Test Case Generation and Optimization","publication_year":2021,"publication_date":"2021-11-17","ids":{"openalex":"https://openalex.org/W3212956295","doi":"https://doi.org/10.32604/iasc.2022.022335","mag":"3212956295"},"language":"en","primary_location":{"id":"doi:10.32604/iasc.2022.022335","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.022335","pdf_url":"https://www.techscience.com/iasc/v32n2/45605/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.techscience.com/iasc/v32n2/45605/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109564174","display_name":"Meena Sharma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Meena Sharma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048805166","display_name":"Babita Pathik","orcid":"https://orcid.org/0000-0002-1523-2141"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Babita Pathik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5048805166"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7519,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84806157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"32","issue":"2","first_page":"1125","last_page":"1140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"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":0.9998000264167786,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7391633987426758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5790566205978394},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.5141535401344299},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4640829563140869},{"id":"https://openalex.org/keywords/code-coverage","display_name":"Code coverage","score":0.4281694293022156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42257213592529297},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4196087121963501},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4178369641304016},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3470671474933624},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.271478533744812},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2643524408340454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.199467271566391}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7391633987426758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5790566205978394},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.5141535401344299},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4640829563140869},{"id":"https://openalex.org/C53942775","wikidata":"https://www.wikidata.org/wiki/Q1211721","display_name":"Code coverage","level":3,"score":0.4281694293022156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42257213592529297},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4196087121963501},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4178369641304016},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3470671474933624},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.271478533744812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2643524408340454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.199467271566391},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.32604/iasc.2022.022335","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.022335","pdf_url":"https://www.techscience.com/iasc/v32n2/45605/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.32604/iasc.2022.022335","is_oa":true,"landing_page_url":"https://doi.org/10.32604/iasc.2022.022335","pdf_url":"https://www.techscience.com/iasc/v32n2/45605/pdf","source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W73562725","https://openalex.org/W1945064413","https://openalex.org/W1964962870","https://openalex.org/W2023091745","https://openalex.org/W2041470132","https://openalex.org/W2098609085","https://openalex.org/W2101352341","https://openalex.org/W2119454181","https://openalex.org/W2177914412","https://openalex.org/W2306115793","https://openalex.org/W2317589922","https://openalex.org/W2586946380","https://openalex.org/W2607390901","https://openalex.org/W2753405783","https://openalex.org/W2799380749","https://openalex.org/W2971605073","https://openalex.org/W3008419219","https://openalex.org/W3041119275","https://openalex.org/W6631162451","https://openalex.org/W6640001192","https://openalex.org/W6640815044","https://openalex.org/W6644248430","https://openalex.org/W6656513279","https://openalex.org/W6674979750","https://openalex.org/W6675077351","https://openalex.org/W6677949801","https://openalex.org/W6729339118"],"related_works":["https://openalex.org/W2373334848","https://openalex.org/W2056754788","https://openalex.org/W2166539025","https://openalex.org/W2148529446","https://openalex.org/W2391310369","https://openalex.org/W2358124340","https://openalex.org/W2293282340","https://openalex.org/W2293009092","https://openalex.org/W2359258249","https://openalex.org/W4366127955"],"abstract_inverted_index":{"Test":[0],"case":[1],"generation":[2],"and":[3,12,48,73,111,114,172,179,191,195],"optimization":[4,39,155,182],"is":[5,24,36,62,135,151,177],"the":[6,53,57,82,103,108,141,145,192],"foremost":[7],"requirement":[8],"of":[9,120,132,144],"software":[10],"evolution":[11],"test":[13,77,90,116,121,133],"automation.":[14],"In":[15],"this":[16,33],"paper,":[17],"a":[18,37,63],"bio-inspired":[19],"Crow":[20],"Search":[21],"Algorithm":[22],"(CSA)":[23],"suggested":[25],"with":[26],"an":[27],"improved":[28,42],"objective":[29,43,83],"function":[30,44],"to":[31,51,157],"fulfill":[32],"requirement.":[34],"CSA":[35,61,74],"nature-inspired":[38],"method.":[40],"The":[41,98,118,129,148,165,184],"combines":[45],"branch":[46],"distance":[47,50],"predicate":[49],"cover":[52],"critical":[54,96],"path":[55,126,189],"on":[56,88],"control":[58,99],"flow":[59,100,105],"graph.":[60,147],"search-based":[64],"technique":[65],"that":[66,174],"uses":[67],"heuristic":[68],"information":[69,104],"for":[70,92,170],"automation":[71],"testing,":[72],"optimizers":[75],"minimize":[76],"cases":[78,91,122],"generated":[79],"by":[80],"satisfying":[81],"function.":[84],"This":[85],"paper":[86],"focuses":[87],"generating":[89],"all":[93,107],"paths,":[94],"including":[95],"paths.":[97,117],"graph":[101,125],"covers":[102],"among":[106],"classes,":[109],"functions,":[110],"conditional":[112],"statements":[113],"provides":[115],"number":[119,131],"examined":[123],"through":[124,137],"coverage":[127],"analysis.":[128],"minimum":[130],"paths":[134],"counted":[136],"complexity":[138,143],"metrics":[139],"using":[140],"cyclomatic":[142],"constructed":[146],"proposed":[149,185],"method":[150],"evaluated":[152],"as":[153],"mathematical":[154],"functions":[156],"validate":[158],"their":[159],"effectiveness":[160],"in":[161,199],"locating":[162],"optimal":[163],"solutions.":[164],"python":[166],"codes":[167],"are":[168],"considered":[169],"evaluation":[171],"revealed":[173],"our":[175],"approach":[176,186],"time-efficient":[178],"outperforms":[180],"various":[181],"algorithms.":[183],"achieved":[187],"100%":[188],"coverage,":[190],"algorithm":[193],"executes":[194],"gives":[196],"optimum":[197],"results":[198],"approximately":[200],"0.2745":[201],"seconds.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-24T06:17:17.354583","created_date":"2025-10-10T00:00:00"}