{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T11:12:44Z","timestamp":1768216364144,"version":"3.49.0"},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We study randomized generation of sequences of test inputs to a system using Prolog. Prolog is a natural fit to generate test sequences that have complex logical interdependent structure. To counter the problems posed by a large (or infinite) set of possible tests, randomization is a natural choice. We study the impact that randomization in conjunction with SLD resolution have on the test performance. To this end, this paper proposes two strategies to add randomization to a test-generating program. One strategy works on top of standard Prolog semantics, whereas the other alters the SLD selection function. We analyze the mean time to reach a test case and the mean number of generated test cases in the framework of Markov chains. Finally, we provide an additional empirical evaluation and comparison between both approaches.<\/jats:p>","DOI":"10.1017\/s1471068425100082","type":"journal-article","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T09:57:37Z","timestamp":1755511057000},"page":"867-895","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Impact and Performance of Randomized Test Generation Using Prolog"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0291-3911","authenticated-orcid":false,"given":"MARCUS","family":"GELDERIE","sequence":"first","affiliation":[{"name":"Aalen University of Applied Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAXIMILIAN","family":"LUFF","sequence":"additional","affiliation":[{"name":"Aalen University of Applied Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAXIMILIAN","family":"PELTZER","sequence":"additional","affiliation":[{"name":"Aalen University of Applied Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,8,18]]},"reference":[{"key":"S1471068425100082_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/800027.808424"},{"key":"S1471068425100082_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-35254-6_8"},{"key":"S1471068425100082_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3661167.3661216"},{"key":"S1471068425100082_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642963"},{"key":"S1471068425100082_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35597-9_32"},{"key":"S1471068425100082_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SEAA.2012.42"},{"key":"S1471068425100082_ref4","doi-asserted-by":"publisher","DOI":"10.1109\/52.73749"},{"key":"S1471068425100082_ref11","unstructured":"Ichiban\/Prolog, . 2024. ichiban\/prolog. Visited: 2024-05-03."},{"key":"S1471068425100082_ref3","first-page":"159","volume-title":"International Symposium on Logic-Based Program Synthesis and Transformation","author":"Casso","year":"2019"},{"key":"S1471068425100082_ref18","unstructured":"Pesch, H. , Schnupp, P. , Schaller, H. and Spirk, A. P. 1985. Test case generation using prolog. In Proceedings of the 8th International Conference on Software Engineering, 252\u2013258."},{"key":"S1471068425100082_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(90)90053-8"},{"key":"S1471068425100082_ref2","first-page":"261","volume-title":"International Joint Conference on Theory and Practice of Software Development","author":"Boug\u00e9","year":"1985"},{"key":"S1471068425100082_ref6","doi-asserted-by":"crossref","unstructured":"Duran, J. W. and Ntafos, S. C. 1984. An evaluation of random testing. IEEE Transactions on Software Engineering SE-10, 4, 438\u2013444.","DOI":"10.1109\/TSE.1984.5010257"},{"key":"S1471068425100082_ref13","doi-asserted-by":"publisher","DOI":"10.1049\/ip-sen:19990602"},{"key":"S1471068425100082_ref17","volume-title":"Markov Chains","author":"Norris","year":"1998"},{"key":"S1471068425100082_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/96267.96279"},{"key":"S1471068425100082_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000494"},{"key":"S1471068425100082_ref22","first-page":"1","article-title":"In-ide code generation from natural language: promise and challenges","volume":"31","author":"Xu","year":"2022","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"S1471068425100082_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-017-0472-3"},{"key":"S1471068425100082_ref24","first-page":"38","volume-title":"Risk Assessment and Risk-Driven Testing: First International Workshop, RISK 2013, Held in Conjunction with ICTSS 2013, Istanbul, Turkey, November 12, 2013. Revised Selected Papers 1","author":"Zech","year":"2013"},{"key":"S1471068425100082_ref12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.1.63"},{"key":"S1471068425100082_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-71294-4_10"},{"key":"S1471068425100082_ref9","doi-asserted-by":"crossref","unstructured":"Gu, Q. 2023. Llm-based code generation method for golang compiler testing. In Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2201\u20132203.","DOI":"10.1145\/3611643.3617850"},{"key":"S1471068425100082_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_9"},{"key":"S1471068425100082_ref10","doi-asserted-by":"publisher","DOI":"10.1109\/32.92913"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068425100082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T08:00:27Z","timestamp":1768204827000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068425100082\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,18]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["S1471068425100082"],"URL":"https:\/\/doi.org\/10.1017\/s1471068425100082","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,18]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}