{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:31:19Z","timestamp":1730298679597,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/ssci.2018.8628861","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T18:15:32Z","timestamp":1551377732000},"page":"688-695","source":"Crossref","is-referenced-by-count":0,"title":["An Enhanced Set-based Evolutionary Algorithm for Generating Test Data that Cover Multiple Paths of a Parallel Program"],"prefix":"10.1109","author":[{"given":"Tian","family":"Tian","sequence":"first","affiliation":[]},{"given":"Su","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Dunwei","family":"Gong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"A tool for structural testing of mpi programs","author":"hausen","year":"2007","journal-title":"8th Latin American Test Workshop (LATW 2007)"},{"key":"ref11","first-page":"386","article-title":"Valipar: A testing tool for message-passing parallel programs","author":"souza","year":"2005","journal-title":"Proceedinds of International Conference on Software Engineering and Knowledge Engineering"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.01.062"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13563-2_4"},{"key":"ref14","first-page":"625","article-title":"Application of genetic algorithms to software testing","author":"xanthakis","year":"1992","journal-title":"Proceedings of the 5th International Conference on Software Engineer- ing and its Applications"},{"key":"ref15","first-page":"58","article-title":"A novel algorithm for multi-path test datage neration","author":"wang","year":"2013","journal-title":"Proceedings of International Conference on Digital Manu- facturing & Automation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.012"},{"key":"ref17","first-page":"1369","article-title":"Optimizing interval higher-dimensional multi- objective problems using set-based evolutionary algorithms incorporated with preferences","volume":"30","author":"gong","year":"2013","journal-title":"Control Theory & Applications"},{"key":"ref18","first-page":"933","article-title":"Set-based evolutionary optimization algorithms integrating decision-makers preferences for many-objective optimization problems","volume":"42","author":"gong","year":"2014","journal-title":"Acta Electronica Sinica"},{"key":"ref19","first-page":"2318","article-title":"Test case generation based on mutation analysis and set evolution","author":"zhang","year":"2015","journal-title":"Chinese Journal of Computers"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24953-7_21"},{"key":"ref3","first-page":"1095","article-title":"Statement-coverage testing for concurrent programs in reachability testing","volume":"30","author":"hwang","year":"2014","journal-title":"J Inform Sci Eng"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2009.32"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.06.020"},{"key":"ref8","first-page":"143","article-title":"Efficient execution path exploration for detecting races in concurrent programs","volume":"40","author":"setiadi","year":"2013","journal-title":"Iaeng Interna- tional Journal of Computer Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.2015.35"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2014.0058"},{"key":"ref1","first-page":"134","article-title":"Research progress in software testing","volume":"41","author":"shan","year":"2005","journal-title":"Acta Scientiarum Naturalium Universitatis Pekinensis"},{"key":"ref9","first-page":"112","article-title":"Efficient test case generation for detecting race conditions","volume":"41","author":"setiadi","year":"2014","journal-title":"IAENG International Journal of Computer Science"},{"journal-title":"Parallel algorithm practice[M]","year":"2004","author":"chen","key":"ref20"},{"journal-title":"Data Structure(C)","year":"2007","author":"yan","key":"ref22"},{"journal-title":"Parallel Computing Theory and Practice","year":"1994","author":"quinn","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LATW.2012.6261240"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.infsof.2016.09.003","article-title":"Reducing scheduling sequences of message-passing parallel programs","volume":"80","author":"gong","year":"2016","journal-title":"Information and Software Technology"}],"event":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2018,11,18]]},"location":"Bangalore, India","end":{"date-parts":[[2018,11,21]]}},"container-title":["2018 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610062\/8628618\/08628861.pdf?arnumber=8628861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T15:59:19Z","timestamp":1648223959000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8628861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ssci.2018.8628861","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}