{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:55:39Z","timestamp":1752674139471,"version":"3.40.4"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"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":[[2025,3,31]]},"DOI":"10.1109\/icstw64639.2025.10962488","type":"proceedings-article","created":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T17:47:42Z","timestamp":1744825662000},"page":"41-49","source":"Crossref","is-referenced-by-count":2,"title":["Novel Algorithm to Solve the Constrained Path-Based Testing Problem"],"prefix":"10.1109","author":[{"given":"Matej","family":"Klima","sequence":"first","affiliation":[{"name":"Czech Technical University in Prague,Czech Republic"}]},{"given":"Miroslav","family":"Bures","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague,Czech Republic"}]},{"given":"Marek","family":"Miltner","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague,Czech Republic"}]},{"given":"Chad","family":"Zanocco","sequence":"additional","affiliation":[{"name":"Stanford University,California"}]},{"given":"Gordon","family":"Fraser","sequence":"additional","affiliation":[{"name":"University of Passau,Germany"}]},{"given":"Sebastian","family":"Schweikl","sequence":"additional","affiliation":[{"name":"University of Passau,Germany"}]},{"given":"Patric","family":"Feldmeier","sequence":"additional","affiliation":[{"name":"University of Passau,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/9781316771273"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2019.07.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2022.3188914"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/qrs62785.2024.00075"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2492248.2492274"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ictck.2015.7582709"},{"key":"ref7","first-page":"134399","article-title":"A time and space-efficient compositional method for prime and test paths generation","volume-title":"IEEE Access","volume":"7","author":"Fazli","year":"2019"},{"issue":"3","key":"ref8","first-page":"92","article-title":"A dataflow analysis approach to program testing","volume":"8","author":"Herman","year":"1976","journal-title":"Australian Computer Journal"},{"issue":"1","key":"ref9","article-title":"A survey on data-flow testing","volume-title":"ACM Comput. Surv.","volume":"50","author":"Su","year":"2017"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-031-40436-8_10","article-title":"Towards efficient data-flow test data generation","volume-title":"Theories of Programming and Formal Methods: Essays Dedicated to Jifeng He on the Occasion of His 80th Birthday.","author":"Su","year":"2023"},{"issue":"1","key":"ref11","first-page":"358","article-title":"Test-case generation for data flow testing of smart contracts based on improved genetic algorithm","volume-title":"IEEE Transactions on Reliability","volume":"72","author":"Ji","year":"2023"},{"key":"ref12","first-page":"340","article-title":"Artificial bee colony algorithm in data flow testing for optimal test suite generation","volume-title":"International Journal of System Assurance Engineering and Management","volume":"11","author":"Sheoran","year":"2020"},{"issue":"1","key":"ref13","first-page":"109","article-title":"The maximum flow problem with disjunctive constraints","volume-title":"Journal of Combinatorial Optimization","volume":"26","author":"Pferschy","year":"2013"},{"issue":"16","key":"ref14","first-page":"1726","article-title":"Paths, trees and matchings under disjunctive constraints","volume-title":"Discrete Applied Mathematics","volume":"159","author":"Darmann","year":"2011"}],"event":{"name":"2025 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","start":{"date-parts":[[2025,3,31]]},"location":"Naples, Italy","end":{"date-parts":[[2025,4,4]]}},"container-title":["2025 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10962452\/10962453\/10962488.pdf?arnumber=10962488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:56:38Z","timestamp":1744869398000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10962488\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icstw64639.2025.10962488","relation":{},"subject":[],"published":{"date-parts":[[2025,3,31]]}}}