{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T01:11:05Z","timestamp":1771981865634,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["SoftwareX"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.softx.2025.102452","type":"journal-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T15:28:42Z","timestamp":1763825322000},"page":"102452","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design"],"prefix":"10.1016","volume":"32","author":[{"given":"Jakub","family":"Zelek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1020-5128","authenticated-orcid":false,"given":"Adam","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.softx.2025.102452_bib0005","series-title":"Introduction to software testing","author":"Ammann","year":"2006"},{"key":"10.1016\/j.softx.2025.102452_bib0010","series-title":"2024 IEEE 24th International Conference on software quality, reliability and Security (QRS)","first-page":"127","article-title":"The acpath structural complexity metric","author":"Bagnara","year":"2024"},{"issue":"2","key":"10.1016\/j.softx.2025.102452_bib0015","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1142\/S021819402350050X","article-title":"Unifying behavioral and feature modeling for testing of software product lines","volume":"34","author":"Belli","year":"2024","journal-title":"Int J Softw Eng Knowl Eng"},{"issue":"3","key":"10.1016\/j.softx.2025.102452_bib0020","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TSE.1978.231496","article-title":"Testing software design modeled by finite-state machines","volume":"SE-4","author":"Chow","year":"1978","journal-title":"IEEE Trans Softw Eng"},{"issue":"1","key":"10.1016\/j.softx.2025.102452_bib0025","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann Math"},{"key":"10.1016\/j.softx.2025.102452_bib0030","series-title":"Testing software and systems","first-page":"63","article-title":"Minimum number of test paths for prime path and other structural coverage criteria","author":"Dwarakanath","year":"2014"},{"key":"10.1016\/j.softx.2025.102452_bib0035","doi-asserted-by":"crossref","first-page":"134399","DOI":"10.1109\/ACCESS.2019.2941429","article-title":"A time and space-efficient compositional method for prime and test paths generation","volume":"7","author":"Fazli","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.softx.2025.102452_bib0040","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","article-title":"Statecharts: a visual formalism for complex systems","volume":"8","author":"Harel","year":"1987","journal-title":"Sci Comput Program"},{"issue":"1","key":"10.1016\/j.softx.2025.102452_bib0045","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","article-title":"Finding all the elementary circuits of a directed graph","volume":"4","author":"Johnson","year":"1975","journal-title":"SIAM J Comput"},{"key":"10.1016\/j.softx.2025.102452_bib0050","series-title":"2017 IEEE 41st annual Computer Software and Applications Conference (COMPSAC)","first-page":"357","article-title":"State-based tests suites automatic generation tool (stage-1)","volume":"vol. 1","author":"Khalil","year":"2017"},{"key":"10.1016\/j.softx.2025.102452_bib0055","series-title":"2025 IEEE International Conference on software Testing, Verification and Validation Workshops (ICSTW)","first-page":"50","article-title":"Cpt manager: an open environment for constrained path-based testing","author":"Klima","year":"2025"},{"key":"10.1016\/j.softx.2025.102452_bib0060","series-title":"2025 IEEE International Conference on software Testing, Verification and Validation Workshops (ICSTW)","first-page":"41","article-title":"Novel algorithm to solve the constrained path-based testing problem","author":"Klima","year":"2025"},{"key":"10.1016\/j.softx.2025.102452_bib0065","series-title":"2025 IEEE International Conference on software Testing, Verification and Validation Workshops (ICSTW)","first-page":"54","article-title":"Towards improving automated testing with Graphwalker","author":"Koroglu","year":"2025"},{"key":"10.1016\/j.softx.2025.102452_bib0070","series-title":"2009 International Conference on software testing, verification, and validation workshops","first-page":"220","article-title":"An experimental comparison of four unit test criteria: mutation, edge-pair, all-uses and prime path coverage","author":"Li","year":"2009"},{"key":"10.1016\/j.softx.2025.102452_bib0075","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1007\/s10836-019-05844-6","article-title":"Comparing graph-based algorithms to generate test cases from finite state machines","volume":"35","author":"Mariano","year":"2019","journal-title":"J Electron Test"},{"issue":"5","key":"10.1016\/j.softx.2025.102452_bib0080","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TSE.1979.234213","article-title":"On path cover problems in digraphs and applications to program testing","volume":"SE-5","author":"Ntafos","year":"1979","journal-title":"IEEE Trans Softw Eng"},{"key":"10.1016\/j.softx.2025.102452_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127216","article-title":"Optimal solutions for variants of graph coverage-related problems in software test design","volume":"277","author":"Pola\u0144ski","year":"2025","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.softx.2025.102452_bib0090","series-title":"2022 IEEE International Conference on software Testing, Verification and Validation Workshops (ICSTW)","first-page":"207","article-title":"Overview of test coverage criteria for test case generation from finite state machines modelled as directed graphs","author":"Rechtberger","year":"2022"},{"key":"10.1016\/j.softx.2025.102452_bib0095","unstructured":"Roman A, Riou du Cosquer E, Cerquozzi R, Decoutere W, Dussa-Zieger K, Riverin J-F, Hryszko A, Klonk M, Pilaeten M, Posthuma M, Reid S, Stapp L, Ulrich S, Zakaria E. ISTQB certified tester - foundation level syllabus v4.0. 2023. https:\/\/www.istqb.org\/certifications\/certified-tester-foundation-level."},{"issue":"1","key":"10.1016\/j.softx.2025.102452_bib0100","doi-asserted-by":"crossref","first-page":"12","DOI":"10.23919\/CSMS.2022.0027","article-title":"Search-based software test data generation for path coverage based on a feedback-directed mechanism","volume":"3","author":"Semujju","year":"2023","journal-title":"Complex Syst Model Simul"},{"key":"10.1016\/j.softx.2025.102452_bib0105","series-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","first-page":"559","article-title":"GraphWalker: An I\/O-Efficient and resource-friendly graph analytic system for fast and scalable random walks","author":"Wang","year":"2020"}],"container-title":["SoftwareX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711025004182?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711025004182?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:48:43Z","timestamp":1771980523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352711025004182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":21,"alternative-id":["S2352711025004182"],"URL":"https:\/\/doi.org\/10.1016\/j.softx.2025.102452","relation":{},"ISSN":["2352-7110"],"issn-type":[{"value":"2352-7110","type":"print"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design","name":"articletitle","label":"Article Title"},{"value":"SoftwareX","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.softx.2025.102452","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102452"}}