{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:47:11Z","timestamp":1761954431284,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032068460","type":"print"},{"value":"9783032068477","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06847-7_9","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:42:25Z","timestamp":1761954145000},"page":"161-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On-the-Fly Cone-of-Influence Reduction for\u00a0Model Checking Concurrent Software"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6260-5908","authenticated-orcid":false,"given":"Csan\u00e1d","family":"Telbisz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6551-5860","authenticated-orcid":false,"given":"Levente","family":"Bajczi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2912-028X","authenticated-orcid":false,"given":"D\u00e1niel","family":"Szekeres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7617-3563","authenticated-orcid":false,"given":"Andr\u00e1s","family":"V\u00f6r\u00f6s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction, pp. 373\u2013384. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-63121-9_26","volume-title":"Models, Algorithms, Logics and Tools","author":"P Abdulla","year":"2017","unstructured":"Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Comparing source sets and persistent sets for partial order reduction. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 516\u2013536. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_26"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Aronis, S., Jonsson, B., Sagonas, K.: Source sets: a foundation for optimal dynamic partial order reduction. J. ACM 64(4), 25:1\u201325:49 (2017). https:\/\/doi.org\/10.1145\/3073408","DOI":"10.1145\/3073408"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., Toman, V.: Stateless model checking under a reads-value-from equivalence. Lecture Notes in Computer Science, vol. 12759, pp. 341\u2013366. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_16","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Agrawal, H., Horgan, J.R.: Dynamic program slicing. pp. 246\u2013256. ACM (1990). https:\/\/doi.org\/10.1145\/93542.93576","DOI":"10.1145\/93542.93576"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-89963-3_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Aronis","year":"2018","unstructured":"Aronis, S., Jonsson, B., L\u00e5ng, M., Sagonas, K.: Optimal dynamic partial order reduction with observers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 229\u2013248. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_14"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Baier, D., et al.: Cpachecker 2.3 with strategy selection - (competition contribution). LNCS, vol. 14572, pp. 359\u2013364. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_21","DOI":"10.1007\/978-3-031-57256-2_21"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bajczi, L., et al.: Theta: Abstraction based techniques for verifying concurrency (competition contribution). LNCS, vol. 14572, pp. 412\u2013417. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_30","DOI":"10.1007\/978-3-031-57256-2_30"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45319-9_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Ball","year":"2001","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Boolean and cartesian abstraction for model checking C programs. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 268\u2013283. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_19"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-49213-5_4","volume-title":"Compositionality: The Significant Difference","author":"S Berezin","year":"1998","unstructured":"Berezin, S., Campos, S., Clarke, E.M.: Compositional reasoning in model checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 81\u2013102. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49213-5_4"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Beyer, D.: State of the art in software verification and witness validation: SV-COMP 2024. LNCS, vol. 14572, pp. 299\u2013329. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_15","DOI":"10.1007\/978-3-031-57256-2_15"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10817-017-9432-6","volume":"60","author":"D Beyer","year":"2017","unstructured":"Beyer, D., Dangl, M., Wendler, P.: A unifying view on SMT-based software verification. J. Autom. Reason. 60(3), 299\u2013335 (2017). https:\/\/doi.org\/10.1007\/s10817-017-9432-6","journal-title":"J. Autom. Reason."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4204\/EPTCS.233.6","volume":"233","author":"D Beyer","year":"2016","unstructured":"Beyer, D., Friedberger, K.: A light-weight approach for verifying multi-threaded programs with CPAchecker. EPTCS 233, 61\u201371 (2016). https:\/\/doi.org\/10.4204\/EPTCS.233.6","journal-title":"EPTCS"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-540-73368-3_51","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Th\u00e9oduloz, G.: Configurable software verification: concretizing the convergence of model checking and program analysis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 504\u2013518. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_51"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-22110-1_16","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2011","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16"},{"key":"9_CR16","unstructured":"Beyer, D., Keremoglu, M.E., Wendler, P.: Predicate abstraction with adjustable-block encoding, pp. 189\u2013197. IEEE (2010)"},{"key":"9_CR17","unstructured":"Beyer, D., L\u00f6we, S.: Explicit-Value Analysis Based on CEGAR and Interpolation. CoRR abs\/1212.6542 (2012)"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Sliced path prefixes: an effective method to enable refinement selection. LNCS, vol.\u00a09039, pp. 228\u2013243. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-19195-9_15","DOI":"10.1007\/978-3-319-19195-9_15"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2017","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transfer 21(1), 1\u201329 (2017). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Blanc, N., Kroening, D.: Race analysis for systemc using model checking. ACM Trans. Design Autom. Electr. Syst. 15(3), 21:1\u201321:32 (2010). https:\/\/doi.org\/10.1145\/1754405.1754406","DOI":"10.1145\/1754405.1754406"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-75596-8_13","volume-title":"Automated Technology for Verification and Analysis","author":"M Bozzano","year":"2007","unstructured":"Bozzano, M., Cimatti, A., Tapparo, F.: Symbolic fault tree analysis for reactive systems. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 162\u2013176. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75596-8_13"},{"issue":"5","key":"9_CR22","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"EM Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003). https:\/\/doi.org\/10.1145\/876638.876643","journal-title":"J. ACM"},{"issue":"5","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"EM Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512\u20131542 (1994). https:\/\/doi.org\/10.1145\/186025.186051","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-35746-6_1","volume-title":"Tools for Practical Software Verification","author":"EM Clarke","year":"2012","unstructured":"Clarke, E.M., Klieber, W., Nov\u00e1\u010dek, M., Zuliani, P.: Model checking and the state explosion problem. In: Meyer, B., Nordio, M. (eds.) LASER 2011. LNCS, vol. 7682, pp. 1\u201330. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35746-6_1"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-99527-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Coto","year":"2022","unstructured":"Coto, A., Inverso, O., Sales, E., Tuosto, E.: A prototype for data race detection in CSeq 3. In: TACAS 2022. LNCS, vol. 13244, pp. 413\u2013417. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_23"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Dietsch, D., Heizmann, M., Klumpp, D., Sch\u00fcssele, F., Podelski, A.: Ultimate taipan and race detection in ultimate - (competition contribution). LNCS, vol. 13994, pp. 582\u2013587. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_40","DOI":"10.1007\/978-3-031-30820-8_40"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Dietsch, D., Heizmann, M., Musa, B., Nutz, A., Podelski, A.: Craig vs. newton in software model checking, pp. 487\u2013497. ACM (2017). https:\/\/doi.org\/10.1145\/3106237.3106307","DOI":"10.1145\/3106237.3106307"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Dwyer, M.B., Clarke, L.A.: Data Flow Analysis for Verifying Properties of Concurrent Programs, pp. 62\u201375. ACM (1994). https:\/\/doi.org\/10.1145\/193173.195295","DOI":"10.1145\/193173.195295"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Eilers, M., Dardinier, T., M\u00fcller, P.: Commcsl: Proving information flow security for concurrent programs using abstract commutativity. Proc. ACM Program. Lang. 7(PLDI), 1682\u20131707 (2023). https:\/\/doi.org\/10.1145\/3591289","DOI":"10.1145\/3591289"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Farzan, A., Klumpp, D., Podelski, A.: Stratified commutativity in verification algorithms for concurrent programs. Proc. ACM Program. Lang. 7(POPL), 1426\u20131453 (2023). https:\/\/doi.org\/10.1145\/3571242","DOI":"10.1145\/3571242"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Qadeer, S.: Predicate abstraction for software verification, pp. 191\u2013202. ACM (2002). https:\/\/doi.org\/10.1145\/503272.503291","DOI":"10.1145\/503272.503291"},{"issue":"6","key":"9_CR32","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s10817-019-09535-x","volume":"64","author":"\u00c1 Hajdu","year":"2019","unstructured":"Hajdu, \u00c1., Micskei, Z.: Efficient strategies for CEGAR-based model checking. J. Autom. Reason. 64(6), 1051\u20131091 (2019). https:\/\/doi.org\/10.1007\/s10817-019-09535-x","journal-title":"J. Autom. Reason."},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/swf.41","volume":"2","author":"M Harman","year":"2001","unstructured":"Harman, M., Hierons, R.M.: An overview of program slicing. Softw. Focus 2(3), 85\u201392 (2001). https:\/\/doi.org\/10.1002\/swf.41","journal-title":"Softw. Focus"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"He, F., Sun, Z., Fan, H.: Deagle: an smt-based verifier for multi-threaded programs (competition contribution). In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 424\u2013428. Springer (2022)","DOI":"10.1007\/978-3-030-99527-0_25"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Heizmann, M., et al.: Ultimate automizer and the commuhash normal form - (competition contribution). LNCS, vol. 13994, pp. 577\u2013581. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_39","DOI":"10.1007\/978-3-031-30820-8_39"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-44829-2_17","volume-title":"Model Checking Software","author":"TA Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Software verification with BLAST. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 235\u2013239. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44829-2_17"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Huang, J.: Stateless model checking concurrent programs with maximal causality reduction. pp. 165\u2013174. ACM (2015). https:\/\/doi.org\/10.1145\/2737924.2737975","DOI":"10.1145\/2737924.2737975"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-030-99527-0_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Klumpp","year":"2022","unstructured":"Klumpp, D., Dietsch, D., Heizmann, M., Sch\u00fcssele, F., Ebbinghaus, M., Farzan, A., Podelski, A.: Ultimate GemCutter and the axes of generalization. In: TACAS 2022. LNCS, vol. 13244, pp. 479\u2013483. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_35"},{"issue":"11\u201312","key":"9_CR39","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/S0950-5849(98)00089-5","volume":"40","author":"B Korel","year":"1998","unstructured":"Korel, B., Rilling, J.: Dynamic program slicing methods. Inf. Softw. Technol. 40(11\u201312), 647\u2013659 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Leeson, W., Dwyer, M.B.: Graves-cpa: a graph-attention verifier selector (competition contribution). In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 440\u2013445. Springer (2022)","DOI":"10.1007\/978-3-030-99527-0_28"},{"key":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-030-72013-1_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Ponce-de-Le\u00f3n","year":"2021","unstructured":"Ponce-de-Le\u00f3n, H., Haas, T., Meyer, R.: Dartagnan: leveraging compiler optimizations and the price of precision (competition contribution). In: TACAS 2021. LNCS, vol. 12652, pp. 428\u2013432. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_26"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Loiacono, C., et al.: Fast cone-of-influence computation and estimation in problems with multiple properties. pp. 803\u2013806. EDA Consortium San Jose, CA, USA\/ACM DL (2013). https:\/\/doi.org\/10.7873\/DATE.2013.170","DOI":"10.7873\/DATE.2013.170"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Nanda, M.G., Ramesh, S.: Slicing concurrent programs, pp. 180\u2013190. ACM (2000). https:\/\/doi.org\/10.1145\/347324.349121","DOI":"10.1145\/347324.349121"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0028727","volume-title":"Computer Aided Verification","author":"D Peled","year":"1998","unstructured":"Peled, D.: Ten years of partial order reduction. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 17\u201328. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028727"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Peled, D.A., Valmari, A., Kokkarinen, I.: Relaxed visibility enhances partial order reduction. Formal Methods Syst. Des. 19(3), 275\u2013289 (2001). https:\/\/doi.org\/10.1023\/A:1011202615884","DOI":"10.1023\/A:1011202615884"},{"issue":"1","key":"9_CR46","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/S10515-020-00270-X","volume":"27","author":"C Richter","year":"2020","unstructured":"Richter, C., H\u00fcllermeier, E., Jakobs, M., Wehrheim, H.: Algorithm selection for software validation based on graph kernels. Autom. Softw. Eng. 27(1), 153\u2013186 (2020). https:\/\/doi.org\/10.1007\/S10515-020-00270-X","journal-title":"Autom. Softw. Eng."},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Su, J., Yang, Z., Xing, H., Yang, J., Tian, C., Duan, Z.: Pichecker: A POR and interpolation based verifier for concurrent programs (competition contribution). LNCS, vol. 13994, pp. 571\u2013576. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_38","DOI":"10.1007\/978-3-031-30820-8_38"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., Hajdu, A., V\u00f6r\u00f6s, A., Micskei, Z., Majzik, I.: Theta: a Framework for Abstraction Refinement-Based Model Checking, pp. 176\u2013179 (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102257","DOI":"10.23919\/FMCAD.2017.8102257"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06847-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:42:27Z","timestamp":1761954147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06847-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032068460","9783032068477"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06847-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Model Checking Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spin2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spin-web.github.io\/SPIN2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}