{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:31:07Z","timestamp":1792787467530,"version":"4.5.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:00:00Z","timestamp":1780876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft","award":["389792660"],"award-info":[{"award-number":["389792660"]}],"id":[{"id":"https:\/\/ror.org\/018mejw64","id-type":"ROR","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NCR25-Fuzz-0001"],"award-info":[{"award-number":["NRF-NCR25-Fuzz-0001"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,6,8]]},"abstract":"<jats:p>\n                    We study the estimation problem for concurrent programs: given a bounded program\n                    <jats:italic toggle=\"yes\">P<\/jats:italic>\n                    , estimate the number of maximal Mazurkiewicz trace\u2013equivalence classes induced by its interleavings. This quantity informs two practical questions for enumeration-based model checking: how long a model checking run is likely to take, and what fraction of the search space has been covered so far. We first show the counting problem is #P-hard even for restricted programs and, unless\n                    <jats:monospace>P = NP<\/jats:monospace>\n                    , inapproximable within any subexponential factor in polynomial time. Thus, we cannot expect efficient exact or randomized approximation algorithms. We give a Monte Carlo approach to find a polynomial-time unbiased estimator: we convert a stateless optimal DPOR algorithm into an unbiased estimator by viewing its exploration as a bounded-depth, bounded-width, tree whose leaves are the maximal Mazurkiewicz traces. A classical estimator by Knuth, when run on this tree, gives an unbiased estimation. In order to control the variance of the estimation, we apply stochastic enumeration by maintaining a small population of partial paths per depth whose evolution is coupled. We have implemented our estimator in the JMC model checker and evaluated it on shared-memory benchmarks. We find that with modest budgets, our estimator yields stable estimates\u2014typically within a 20% band\u2014within a few hundred trials, even when the state space has 10\n                    <jats:sup>5<\/jats:sup>\n                    \u201310\n                    <jats:sup>6<\/jats:sup>\n                    classes. We also show how the same machinery estimates model-checking cost by weighting all explored traces, not only the maximal ones. Our algorithms provide the first provable poly-time unbiased estimators for counting Mazurkiewicz traces.\n                  <\/jats:p>","DOI":"10.1145\/3808291","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:04:09Z","timestamp":1780941849000},"page":"1102-1126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["State Space Estimation for DPOR-Based Model Checkers"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7258-5445","authenticated-orcid":false,"given":"A. R.","family":"Balasubramanian","sequence":"first","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7753-9017","authenticated-orcid":false,"given":"Mohammad Hossein","family":"Khoshechin Jorshari","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2136-0542","authenticated-orcid":false,"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-0660","authenticated-orcid":false,"given":"Umang","family":"Mathur","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5017-2228","authenticated-orcid":false,"given":"Minjian","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign-Urbana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,8]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Parosh Aziz Abdulla Stavros Aronis Mohamed Faouzi Atig Bengt Jonsson Carl Leonardsson and Konstantinos Sagonas. 2015. Stateless Model Checking for TSO and PSO. In Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems-Volume 9035 (TACAS\u201915). 353\u2013367. https:\/\/doi.org\/10.1007\/978-3-662-46681-0_28 10.1007\/978-3-662-46681-0_28","DOI":"10.1007\/978-3-662-46681-0_28"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Parosh Aziz Abdulla Stavros Aronis Bengt Jonsson and Konstantinos Sagonas. 2014. Optimal dynamic partial order reduction. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL \u201914). ACM New York NY USA 373\u2013384. https:\/\/doi.org\/10.1145\/2535838.2535845 10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Parosh Aziz Abdulla Mohamed Faouzi Atig Sarbojit Das Bengt Jonsson and Konstantinos Sagonas. 2024. Parsimonious optimal dynamic partial order reduction. In International Conference on Computer Aided Verification (CAV\u201924). Springer 19\u201343. https:\/\/doi.org\/10.1007\/978-3-031-65630-9_2 10.1007\/978-3-031-65630-9_2","DOI":"10.1007\/978-3-031-65630-9_2"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Parosh Aziz Abdulla Mohamed Faouzi Atig Bengt Jonsson Magnus L\u00e5ng Tuan Phong Ngo and Konstantinos Sagonas. 2019. Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3 OOPSLA Article 150 (Oct. 2019) 29 pages. https:\/\/doi.org\/10.1145\/3360576 10.1145\/3360576","DOI":"10.1145\/3360576"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Yehuda Afek Eli Gafni and Adam Morrison. 2007. Common2 extended to stacks and unbounded concurrency. Distributed Comput. 20 (2007). https:\/\/doi.org\/10.1007\/S00446-007-0023-3 10.1007\/S00446-007-0023-3","DOI":"10.1007\/S00446-007-0023-3"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Pratyush Agarwal Krishnendu Chatterjee Shreya Pathak Andreas Pavlogiannis and Viktor Toman. 2021. Stateless Model Checking Under a Reads-Value-From Equivalence. In Computer Aided Verification Alexandra Silva and K. Rustan M. Leino (Eds.). Springer International Publishing Cham 341\u2013366.","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Marcelo Arenas Luis Alberto Croquevielle Rajesh Jayaram and Cristian Riveros. 2020. Efficient Logspace Classes for Enumeration Counting and Uniform Generation. SIGMOD Rec. 49 1 (Sept. 2020) 52\u201359. https:\/\/doi.org\/10.1145\/3422648.3422661 10.1145\/3422648.3422661","DOI":"10.1145\/3422648.3422661"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511804090 10.1017\/CBO9780511804090","DOI":"10.1017\/CBO9780511804090"},{"key":"e_1_3_1_10_2","doi-asserted-by":"crossref","unstructured":"A. R. Balasubramanian Mohammad Hossein Khoshechin Jorshari Rupak Majumdar Umang Mathur and Minjian Zhang. 2026. State Space Estimation for DPOR-based Model Checkers. arXiv:2512.23996 https:\/\/arxiv.org\/abs\/2512.23996","DOI":"10.1145\/3808291"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","unstructured":"A. R. Balasubramanian Mohammad Hossein Khoshechin Jorshari Rupak Majumdar Umang Mathur and Minjian Zhang. 2026. State Space Estimation for DPOR-based Model Checkers (Artifact). https:\/\/doi.org\/10.5281\/zenodo.19625358 10.5281\/zenodo.19625358","DOI":"10.5281\/zenodo.19625358"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Rudolf Bayer and Mario Schkolnick. 1977. Concurrency of Operations on B-Trees. Acta Informatica 9 (1977) 1\u201321. https:\/\/doi.org\/10.1007\/BF00263762 10.1007\/BF00263762","DOI":"10.1007\/BF00263762"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Marcel B\u00f6hme. 2018. STADS: Software Testing as Species Discovery. ACM Trans. Softw. Eng. Methodol. 27 2 Article 7 (June 2018) 52 pages. https:\/\/doi.org\/10.1145\/3210309 10.1145\/3210309","DOI":"10.1145\/3210309"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Marcel B\u00f6hme Danushka Liyanage and Valentin W\u00fcstholz. 2021. Estimating residual risk in greybox fuzzing. In Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (Athens Greece) (ESEC\/FSE 2021). Association for Computing Machinery New York NY USA 230\u2013241. https:\/\/doi.org\/10.1145\/3468264.3468570 10.1145\/3468264.3468570","DOI":"10.1145\/3468264.3468570"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Marcel B\u00f6hme Valentin J. M. Man\u00e8s and Sang Kil Cha. 2023. Boosting Fuzzer Efficiency: An Information Theoretic Perspective. Commun. ACM 66 11 (Oct. 2023) 89\u201397. https:\/\/doi.org\/10.1145\/3611019 10.1145\/3611019","DOI":"10.1145\/3611019"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Arkady Bron Eitan Farchi Yonit Magid Yarden Nir and Shmuel Ur. 2005. Applications of synchronization coverage. In Proceedings of the Tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Chicago IL USA) (PPoPP \u201905). Association for Computing Machinery New York NY USA. https:\/\/doi.org\/10.1145\/1065944.1065972 10.1145\/1065944.1065972","DOI":"10.1145\/1065944.1065972"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Supratik Chakraborty Kuldeep S Meel and Moshe Y Vardi. 2013. A Scalable Approximate Model Counter. In International Conference on Principles and Practice of Constraint Programming. Springer 200\u2013216. https:\/\/doi.org\/10.1007\/978-3-642-40627-0_18 10.1007\/978-3-642-40627-0_18","DOI":"10.1007\/978-3-642-40627-0_18"},{"key":"e_1_3_1_18_2","unstructured":"JMC: Java Model Checker. 2026. https:\/\/jmc.mpi-sws.org\/"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Hana Chockler Orna Kupferman and Moshe Y. Vardi. 2003. Coverage Metrics for Formal Verification. In Correct Hardware Design and Verification Methods Daniel Geist and Enrico Tronci (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 111\u2013125. https:\/\/doi.org\/10.1007\/978-3-540-39724-3_11 10.1007\/978-3-540-39724-3_11","DOI":"10.1007\/978-3-540-39724-3_11"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Alexis de Colnet Kuldeep S. Meel and Umang Mathur. 2026. Counting and Sampling Traces in Regular Languages. Proc. ACM Program. Lang. 10 POPL (2026) 2352\u20132379. https:\/\/doi.org\/10.1145\/3776723 10.1145\/3776723","DOI":"10.1145\/3776723"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Mike Dodds Andreas Haas and Christoph M. Kirsch. 2015. A Scalable Correct Time-Stamped Stack. In 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Mumbai India) (POPL \u201915). ACM New York NY USA 233\u2013246. https:\/\/doi.org\/10.1145\/2676726.2676963 10.1145\/2676726.2676963","DOI":"10.1145\/2676726.2676963"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Constantin Enea Dimitra Giannakopoulou Michalis Kokologiannakis and Rupak Majumdar. 2024. Model Checking Distributed Protocols in Must. Proc. ACM Program. Lang. 8 OOPSLA2 Article 338 (Oct. 2024) 28 pages. https:\/\/doi.org\/10.1145\/3689778 10.1145\/3689778","DOI":"10.1145\/3689778"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Azadeh Farzan and Umang Mathur. 2024. Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8 POPL Article 31 (Jan. 2024) 31 pages. https:\/\/doi.org\/10.1145\/3632873 10.1145\/3632873","DOI":"10.1145\/3632873"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Cormac Flanagan and Patrice Godefroid. 2005. Dynamic partial-order reduction for model checking software. In POPL 2005. ACM New York NY USA 110\u2013121. https:\/\/doi.org\/10.1145\/1040305.1040315 10.1145\/1040305.1040315","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","unstructured":"Patrice Godefroid. 1996. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Lecture Notes in Computer Science Vol. 1032. Springer. https:\/\/doi.org\/10.1007\/3-540-60761-7 10.1007\/3-540-60761-7","DOI":"10.1007\/3-540-60761-7"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Patrice Godefroid. 1997. Model checking for programming languages using VeriSoft. In POPL 1997 (Paris France). ACM New York NY USA 174\u2013186. https:\/\/doi.org\/10.1145\/263699.263717 10.1145\/263699.263717","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Vivek Gore Mark Jerrum Sampath Kannan Z. Sweedyk and Stephen R. Mahaney. 1997. A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. Inf. Comput. 134 1 (1997) 59\u201374. https: \/\/doi.org\/10.1006\/INCO.1997.2621 10.1006\/INCO.1997.2621","DOI":"10.1006\/INCO.1997.2621"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Klaus Havelund and Thomas Pressburger. 2000. Model Checking JAVA Programs using JAVA PathFinder. Int. J. Soft. Tool. Tech. Transf. 2 4 (2000) 366\u2013381. https:\/\/doi.org\/10.1007\/S100090050043 10.1007\/S100090050043","DOI":"10.1007\/S100090050043"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The Art of Multiprocessor Programming (2nd ed.). Morgan Kaufmann Publishers Inc. https:\/\/doi.org\/10.1016\/C2011-0-06993-4 10.1016\/C2011-0-06993-4","DOI":"10.1016\/C2011-0-06993-4"},{"key":"e_1_3_1_30_2","unstructured":"Gerard J Holzmann. 2004. The SPIN model checker: Primer and reference manual. Vol. 1003. Addison-Wesley Reading."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Gary A. Huber and Sangtae Kim. 1996. Weighted-Ensemble Brownian Dynamics Simulations for Protein Association Reactions. Biophysical Journal 70 (1996) 97\u2013110. https:\/\/doi.org\/10.1016\/S0006-3495(96)79552-8 10.1016\/S0006-3495(96)79552-8","DOI":"10.1016\/S0006-3495(96)79552-8"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Mark Jerrum Leslie G. Valiant and Vijay V. Vazirani. 1986. Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43 (1986) 169\u2013188. https:\/\/doi.org\/10.1016\/0304-3975(86)90174-X 10.1016\/0304-3975(86)90174-X","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_1_33_2","unstructured":"Mohammad Hossein Khoshechin Jorshari Michalis Kokologiannakis Rupak Majumdar and Srinidhi Nagendra. 2025. Optimal Concolic Dynamic Partial Order Reduction. In 36th International Conference on Concurrency Theory (CONCUR 2025) Vol. 348. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik Dagstuhl Germany 26:1\u201326:22. https: \/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.CONCUR.2025.26"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Donald E. Knuth. 1975. Estimating the Efficiency of Backtrack Programs. Math. Comp. 29 129 (1975) 121\u2013136. https:\/\/doi.org\/10.2307\/2005469 10.2307\/2005469","DOI":"10.2307\/2005469"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Michalis Kokologiannakis Rupak Majumdar and Viktor Vafeiadis. 2024. Enhancing GenMC\u2019s Usability and Performance. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Springer Nature Switzerland Cham 66\u201384. https:\/\/doi.org\/10.1007\/978-3-031-57249-4_4 10.1007\/978-3-031-57249-4_4","DOI":"10.1007\/978-3-031-57249-4_4"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Michalis Kokologiannakis Iason Marmanis Vladimir Gladstein and Viktor Vafeiadis. 2022. Truly stateless optimal dynamic partial order reduction. Proc. ACM Program. Lang. 6 POPL Article 49 (Jan. 2022) 26 pages. https:\/\/doi.org\/10.1145\/3498711 10.1145\/3498711","DOI":"10.1145\/3498711"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","unstructured":"Stephan Lipp Daniel Elsner Severin Kacianka Alexander Pretschner Marcel B\u00f6hme and Sebastian Banescu. 2023. Green Fuzzing: A Saturation-Based Stopping Criterion using Vulnerability Prediction. In Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis (Seattle WA USA) (ISSTA 2023). Association for Computing Machinery New York NY USA 127\u2013139. https:\/\/doi.org\/10.1145\/3597926.3598043 10.1145\/3597926.3598043","DOI":"10.1145\/3597926.3598043"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","unstructured":"Danushka Liyanage Seongmin Lee Chakkrit Tantithamthavorn and Marcel B\u00f6hme. 2024. Extrapolating Coverage Rate in Greybox Fuzzing. In Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering (Lisbon Portugal) (ICSE \u201924). Association for Computing Machinery New York NY USA Article 132 12 pages. https:\/\/doi.org\/10.1145\/3597503.3639198 10.1145\/3597503.3639198","DOI":"10.1145\/3597503.3639198"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","unstructured":"Kuldeep S Meel Sourav Chakraborty and Umang Mathur. 2024. A faster FPRAS for #NFA. Proceedings of the ACM on Management of Data 2 2 (2024) 1\u201322. https:\/\/doi.org\/10.1145\/3651613 10.1145\/3651613","DOI":"10.1145\/3651613"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","unstructured":"Kuldeep S Meel and Alexis de Colnet. 2025. Towards practical FPRAS for #NFA: Exploiting the Power of Dependence. Proceedings of the ACM on Management of Data 3 2 (2025) 1\u201323. https:\/\/doi.org\/10.1145\/3725253 10.1145\/3725253","DOI":"10.1145\/3725253"},{"key":"e_1_3_1_41_2","unstructured":"John Penix Willem Visser and Peter Norvig. 2001. Coverage Metrics for Model Checking. (2001). https:\/\/ntrs.nasa.gov\/citations\/20010106055"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Leonard Pitt. 1987. A note on extending Knuth\u2019s tree estimator to directed acyclic graphs. Inform. Process. Lett. 24 3 (1987) 203\u2013206. https:\/\/doi.org\/10.1016\/0020-0190(87)90187-6 10.1016\/0020-0190(87)90187-6","DOI":"10.1016\/0020-0190(87)90187-6"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","unstructured":"Reuven Rubinstein. 2013. Stochastic enumeration method for counting NP-hard problems. Methodology and Computing in Applied Probability 15 2 (2013) 249\u2013291. https:\/\/doi.org\/10.1007\/s11009-011-9242-y 10.1007\/s11009-011-9242-y","DOI":"10.1007\/s11009-011-9242-y"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","unstructured":"Larry J. Stockmeyer. 1985. On Approximation Algorithms for #P. SIAM J. Comput. 14 4 (1985) 849\u2013861. https:\/\/doi.org\/10.1137\/0214060 10.1137\/0214060","DOI":"10.1137\/0214060"},{"key":"e_1_3_1_45_2","unstructured":"SV-COMP. 2019. Competition on Software Verification (SV-COMP). https:\/\/sv-comp.sosy-lab.org\/2019\/"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","unstructured":"Ali Taleghani and Joanne M. Atlee. 2009. State-Space Coverage Estimation. In 2009 IEEE\/ACM International Conference on Automated Software Engineering. 459\u2013467. https:\/\/doi.org\/10.1109\/ASE.2009.24 10.1109\/ASE.2009.24","DOI":"10.1109\/ASE.2009.24"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Radislav Vaisman and Dirk P Kroese. 2017. Stochastic enumeration method for counting trees. Methodology and Computing in Applied Probability 19 1 (2017) 31\u201373. https:\/\/doi.org\/10.1007\/s11009-015-9457-4 10.1007\/s11009-015-9457-4","DOI":"10.1007\/s11009-015-9457-4"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","unstructured":"Leslie G. Valiant. 1979. The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8 3 (1979) 410\u2013421. https:\/\/doi.org\/10.1137\/0208032 10.1137\/0208032","DOI":"10.1137\/0208032"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","unstructured":"Kaiyuan Wang Hayes Converse Milos Gligoric Sasa Misailovic and Sarfraz Khurshid. 2018. A Progress Bar for the JPF Search Using Program Executions. ACM SIGSOFT Softw. Eng. Notes 43 4 (2018) 55. https:\/\/doi.org\/10.1145\/3282517.3282525 10.1145\/3282517.3282525","DOI":"10.1145\/3282517.3282525"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3808291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T10:53:15Z","timestamp":1790074395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3808291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,8]]},"references-count":48,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2026,6,8]]}},"alternative-id":["10.1145\/3808291"],"URL":"https:\/\/doi.org\/10.1145\/3808291","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,8]]},"assertion":[{"value":"2025-11-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}