{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:16:57Z","timestamp":1725578217556},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"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":[[2021,9,22]]},"DOI":"10.1109\/csit52700.2021.9648799","type":"proceedings-article","created":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T16:20:42Z","timestamp":1640622042000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of the unit test generation task for parallel computations"],"prefix":"10.1109","author":[{"given":"Roman","family":"Bazylevych","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Czarnul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrii","family":"Franko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2016.0046"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3092282.3092293"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25209-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00014"},{"key":"ref5","first-page":"50","article-title":"Cube and conquer: guiding CDCL SAT solvers by lookaheads","author":"heule","year":"2011","journal-title":"Proc of Haifa Verification Conf"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CSIT49958.2020.9321971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/STC-CSIT.2019.8929755"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2017.05.009"},{"key":"ref1","first-page":"548","article-title":"Parser-directed fuzzing","author":"bjorn","year":"2019","journal-title":"Proc ACM SIGPLAN Conf Programming Language Design and Implementation"}],"event":{"name":"2021 IEEE 16th International Conference on Computer Sciences and Information Technologies (CSIT)","start":{"date-parts":[[2021,9,22]]},"location":"LVIV, Ukraine","end":{"date-parts":[[2021,9,25]]}},"container-title":["2021 IEEE 16th International Conference on Computer Sciences and Information Technologies (CSIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9648574\/9648581\/09648799.pdf?arnumber=9648799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:59:57Z","timestamp":1652187597000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9648799\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,22]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/csit52700.2021.9648799","relation":{},"subject":[],"published":{"date-parts":[[2021,9,22]]}}}