{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T09:19:35Z","timestamp":1770455975007,"version":"3.49.0"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2941429","type":"journal-article","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T20:26:02Z","timestamp":1568406362000},"page":"134399-134410","source":"Crossref","is-referenced-by-count":7,"title":["A Time and Space-Efficient Compositional Method for Prime and Test Paths Generation"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6920-3824","authenticated-orcid":false,"given":"Ebrahim","family":"Fazli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Afsharchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"ford","year":"2015","journal-title":"Flows in Networks"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISTEL.2014.7000678"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.108"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(00)00093-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233837"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/42372.42379"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234213"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICTCK.2015.7582709"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5121\/ijsea.2010.1202"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref4","author":"ammann","year":"2008","journal-title":"Graph Coverage Web Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/9781316771273"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68972-2_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786863"},{"key":"ref8","article-title":"Employment of multiple algorithms for optimal path-based test selection strategy","author":"bures","year":"2018","journal-title":"arXiv 1802 08005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194002001074"},{"key":"ref2","first-page":"1","article-title":"Efficient algorithms for constructing testing sets, covering paths, and minimum flows","author":"aho","year":"1987"},{"key":"ref1","first-page":"3","volume":"19","author":"aho","year":"1983","journal-title":"Data structures and algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44857-1_5"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08836452.pdf?arnumber=8836452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:41:07Z","timestamp":1628624467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8836452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2941429","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}