{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:45Z","timestamp":1750220745967,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo - FAPESP","award":["2018\/25744-6"],"award-info":[{"award-number":["2018\/25744-6"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,18]]},"DOI":"10.1145\/3395363.3402646","type":"proceedings-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T21:44:18Z","timestamp":1594676658000},"page":"587-591","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Automatic support for the identification of infeasible testing requirements"],"prefix":"10.1145","author":[{"given":"Jo\u00e3o","family":"Choma Neto","sequence":"first","affiliation":[{"name":"University of S\u00e3o Paulo, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536358"},{"key":"e_1_3_2_1_2_1","unstructured":"B Barhoush and I Alsmadi. 2013. Infeasible Paths Detection Using Static Analysis. Ijj.Acm. Org II Iii ( 2013 ).  B Barhoush and I Alsmadi. 2013. Infeasible Paths Detection Using Static Analysis. Ijj.Acm. Org II Iii ( 2013 )."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R Bod\u00edk R Gupta and M L Sofa. 1997. Refining data flow information using infeasible paths. ACM SIGSOFT Software Engineering Notes 22 6 ( 1997 ) 361-377.  R Bod\u00edk R Gupta and M L Sofa. 1997. Refining data flow information using infeasible paths. ACM SIGSOFT Software Engineering Notes 22 6 ( 1997 ) 361-377.","DOI":"10.1145\/267896.267921"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2000.873665"},{"volume-title":"Software Maintenance, 1999. (ICSM'99) Proceedings. IEEE International Conference on. IEEE, 199-208","year":"1999","author":"Chung IS","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233817"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S S Dahiya J K Chhabra and S Kumar. 2011. PSO Based Pseudo Dynamic Method for Automated Test Case Generation Using Interpreter. 147 pages. arXiv:9780201398298  S S Dahiya J K Chhabra and S Kumar. 2011. PSO Based Pseudo Dynamic Method for Automated Test Case Generation Using Interpreter. 147 pages. arXiv:9780201398298","DOI":"10.1007\/978-3-642-21515-5_18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"M Delahaye B Botella and A Gotlieb. 2015. Infeasible path generalization in dynamic symbolic execution. Information and Software Technology 58 ( 2015 ) 403-418.  M Delahaye B Botella and A Gotlieb. 2015. Infeasible path generalization in dynamic symbolic execution. Information and Software Technology 58 ( 2015 ) 403-418.","DOI":"10.1016\/j.infsof.2014.07.012"},{"key":"e_1_3_2_1_9_1","first-page":"203","article-title":"A Taxonomy of Distributed Debuggers Based on Execution Replay","author":"Dionne Carl","year":"1996","journal-title":"PDPTA."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.05.071"},{"key":"e_1_3_2_1_12_1","unstructured":"D. Hedley and M. A. Hennell. 1985. The causes and efects of infeasible paths in computer programs. ( 1985 ) 259-266.  D. Hedley and M. A. Hennell. 1985. The causes and efects of infeasible paths in computer programs. ( 1985 ) 259-266."},{"volume-title":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03. May ( 2003 ), 184","author":"Hermadi I.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"I. Hermadi C. Lokan and R. Sarker. 2014. Dynamic stopping criteria for searchbased test data generation for path testing. Information and Software Technology 56 4 ( 2014 ) 395-407.  I. Hermadi C. Lokan and R. Sarker. 2014. Dynamic stopping criteria for searchbased test data generation for path testing. Information and Software Technology 56 4 ( 2014 ) 395-407.","DOI":"10.1016\/j.infsof.2014.01.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"D Kundu M Sarma and D Samanta. 2015. A UML model-based approach to detect infeasible paths. Journal of Systems and Software 107 ( 2015 ) 71-92.  D Kundu M Sarma and D Samanta. 2015. A UML model-based approach to detect infeasible paths. Journal of Systems and Software 107 ( 2015 ) 71-92.","DOI":"10.1016\/j.jss.2015.05.007"},{"volume-title":"Software Reliability Engineering, 2005. ISSRE 2005. 16th IEEE International Symposium on. IEEE, 10-pp.","year":"2005","author":"Lei Y","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"N. Malevris D. F. Yates and A. Veevers. 1990. Predictive metric for likely feasibility of program paths. Information and Software Technology 32 2 ( 1990 ) 115-118.  N. Malevris D. F. Yates and A. Veevers. 1990. Predictive metric for likely feasibility of program paths. Information and Software Technology 32 2 ( 1990 ) 115-118.","DOI":"10.1016\/0950-5849(90)90110-D"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.5055481"},{"key":"e_1_3_2_1_19_1","first-page":"153","article-title":"Search-based software testing: Past, present and future. In Software testing, verification and validation workshops (icstw), 2011 ieee fourth international conference on","author":"McMinn P.","year":"2011","journal-title":"IEEE"},{"volume-title":"The art of software testing","author":"Myers G J","key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781119202486"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287655"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2007.06.006"},{"volume-title":"An introduction to parallel programming","author":"Pacheco P","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"K Petersen S Vakkalanka and L Kuzniarz. 2015. Guidelines for conducting systematic mapping studies in software engineering: An update. Information and Software Technology 64 ( 2015 ) 1-18.  K Petersen S Vakkalanka and L Kuzniarz. 2015. Guidelines for conducting systematic mapping studies in software engineering: An update. Information and Software Technology 64 ( 2015 ) 1-18.","DOI":"10.1016\/j.infsof.2015.03.007"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.26"},{"volume-title":"PSL Souza, AS Simao, and Alexandre Ceolin Hausen.","year":"2008","author":"Souza SRS","key":"e_1_3_2_1_26_1"},{"volume-title":"Software Engineering for Parallel and Distributed Systems, 1999. Proceedings. International Symposium on. IEEE, 97-108","author":"K","key":"e_1_3_2_1_27_1"},{"volume-title":"Emergent Trends in Robotics and Intelligent Systems","author":"Takagi H.","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","unstructured":"S R Vergilio J C Maldonado and M Jino. 1992. Non-executable paths: Characterization Prediction and Determination to Support Program Testing-In Portuguese.  S R Vergilio J C Maldonado and M Jino. 1992. Non-executable paths: Characterization Prediction and Determination to Support Program Testing-In Portuguese."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03192389"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601248"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"D Yates and N Malevris. 1989. Reducing the efects of infeasible paths in branch testing. ACM SIGSOFT Software Engineering Notes 14 8 ( 1989 ) 48-54.  D Yates and N Malevris. 1989. Reducing the efects of infeasible paths in branch testing. ACM SIGSOFT Software Engineering Notes 14 8 ( 1989 ) 48-54.","DOI":"10.1145\/75309.75315"}],"event":{"name":"ISSTA '20: 29th ACM SIGSOFT International Symposium on Software Testing and Analysis","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Virtual Event USA","acronym":"ISSTA '20"},"container-title":["Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3395363.3402646","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3395363.3402646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:45Z","timestamp":1750199925000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3395363.3402646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":31,"alternative-id":["10.1145\/3395363.3402646","10.1145\/3395363"],"URL":"https:\/\/doi.org\/10.1145\/3395363.3402646","relation":{},"subject":[],"published":{"date-parts":[[2020,7,18]]},"assertion":[{"value":"2020-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}