{"id":"https://openalex.org/W2968348231","doi":"https://doi.org/10.1145/3338906.3342496","title":"Finding the shortest path to reproduce a failure found by TESTAR","display_name":"Finding the shortest path to reproduce a failure found by TESTAR","publication_year":2019,"publication_date":"2019-08-09","ids":{"openalex":"https://openalex.org/W2968348231","doi":"https://doi.org/10.1145/3338906.3342496","mag":"2968348231"},"language":"en","primary_location":{"id":"doi:10.1145/3338906.3342496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338906.3342496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","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/A5073234990","display_name":"Olivia Rodriguez Valdes","orcid":null},"institutions":[{"id":"https://openalex.org/I2656126","display_name":"University of Havana","ror":"https://ror.org/04204gr61","country_code":"CU","type":"education","lineage":["https://openalex.org/I2656126"]}],"countries":["CU"],"is_corresponding":true,"raw_author_name":"Olivia Rodriguez Valdes","raw_affiliation_strings":["Technological University of Havana, Cuba"],"affiliations":[{"raw_affiliation_string":"Technological University of Havana, Cuba","institution_ids":["https://openalex.org/I2656126"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073234990"],"corresponding_institution_ids":["https://openalex.org/I2656126"],"apc_list":null,"apc_paid":null,"fwci":1.0039,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78515871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1223","last_page":"1225"},"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.9998999834060669,"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.9998999834060669,"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/T12127","display_name":"Software System Performance and Reliability","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9972000122070312,"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/tree-traversal","display_name":"Tree traversal","score":0.7874046564102173},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.7244362235069275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.71701979637146},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.606410801410675},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5462129712104797},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4413125216960907},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32456398010253906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31421801447868347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2656681537628174},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25163137912750244}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7874046564102173},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.7244362235069275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.71701979637146},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.606410801410675},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5462129712104797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4413125216960907},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32456398010253906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31421801447868347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2656681537628174},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25163137912750244}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3338906.3342496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338906.3342496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:research.ou.nl:publications/dade9713-00d8-4b9d-a56a-426f5bfbd8b1","is_oa":false,"landing_page_url":"https://research.ou.nl/en/publications/dade9713-00d8-4b9d-a56a-426f5bfbd8b1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Valdes, O R 2019, Finding the shortest path to reproduce a failure found by TESTAR. in M Dumas & D Pfahl (eds), Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. Association for Computing Machinery, New York, USA, pp. 1223-1225, 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Talinn, Estonia, 26/08/19. https://doi.org/10.1145/3338906.3342496","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1613273921","https://openalex.org/W1839086001","https://openalex.org/W2003431502","https://openalex.org/W2026926213","https://openalex.org/W2463553622","https://openalex.org/W4248799824"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W244044452","https://openalex.org/W4377236495"],"abstract_inverted_index":{"TESTAR":[0,26,89],"is":[1],"a":[2,36,51,58],"tool":[3],"for":[4],"automated":[5,15],"testing":[6],"via":[7],"the":[8,20,24,33,48,65,69,80],"GUI.":[9],"It":[10],"uses":[11],"dynamic":[12],"analysis":[13,67],"during":[14,23,45],"GUI":[16],"exploration":[17],"and":[18],"generates":[19],"test":[21],"sequences":[22,55],"execution.":[25],"saves":[27],"all":[28],"kind":[29],"of":[30,68],"information":[31],"about":[32],"tests":[34,49],"in":[35],"Graph":[37],"database":[38],"that":[39],"can":[40,60],"be":[41,61],"queried":[42],"or":[43,46],"traversed":[44],"after":[47],"using":[50],"traversal":[52],"language.":[53],"Test":[54],"leading":[56],"to":[57,78,83],"failure":[59,70],"excessively":[62],"long,":[63],"making":[64],"root-cause":[66],"difficult.":[71],"This":[72],"paper":[73],"proposes":[74],"an":[75,85],"initial":[76],"approach":[77],"find":[79],"shortest":[81],"path":[82],"reproduce":[84],"error":[86],"found":[87],"by":[88]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}