{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:16:34Z","timestamp":1784837794473,"version":"3.55.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_18","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:52:28Z","timestamp":1776289948000},"page":"333-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Real-time Proof Checking for Distributed Incremental SAT Solving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4185-1851","authenticated-orcid":false,"given":"Dominik","family":"Schreiber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1705-3083","authenticated-orcid":false,"given":"Mathias","family":"Fleury","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0497-3059","authenticated-orcid":false,"given":"Katalin","family":"Fazekas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-9242","authenticated-orcid":false,"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Aumasson, J.P., Bernstein, D.J.: SipHash: a fast short-input PRF. In: International Conference on Cryptology in India. pp. 489\u2013508. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_28","DOI":"10.1007\/978-3-642-34931-7_28"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Balyo, T., Sinz, C.: Parallel satisfiability. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-63516-3_1","DOI":"10.1007\/978-3-319-63516-3_1"},{"key":"18_CR3","unstructured":"Behnke, G., H\u00f6ller, D., Bercher, P. (eds.): Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts \u2013 Hierarchical Task Network (HTN) Planning Track (IPC 2020) (2021), https:\/\/ipc2020.hierarchical-task.net\/publications\/IPC2020Booklet.pdf"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Berners-Lee, T., Fielding, R., Masinter, L.: Uniform resource identifier (uri): Generic syntax. Tech. rep. (2005). https:\/\/doi.org\/10.17487\/rfc3986","DOI":"10.17487\/rfc3986"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Biere, A., Faller, T., Fazekas, K., Fleury, M., Froleyks, N., Pollitt, F.: CaDiCaL 2.0. In: International Conference on Computer Aided Verification. pp. 133\u2013152. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65627-9_7","DOI":"10.1007\/978-3-031-65627-9_7"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Cantor, G.: Ein Beitrag zur Mannigfaltigkeitslehre. Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal) 1878(84), 242\u2013258 (1878). https:\/\/doi.org\/10.1515\/crelle-1878-18788413","DOI":"10.1515\/crelle-1878-18788413"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Chong, N., Cook, B., Kallas, K., Khazem, K., Monteiro, F.R., Schwartz-Narbonne, D., Tasiran, S., Tautschnig, M., Tuttle, M.R.: Code-level model checking in the software development workflow. In: Proceedings of the ACM\/IEEE 42nd International Conference on Software Engineering: Software Engineering in Practice. p. 11\u201320. ICSE-SEIP \u201920 (2020). https:\/\/doi.org\/10.1145\/3377813.3381347","DOI":"10.1145\/3377813.3381347"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Cruz-Filipe, L., Heule, M.J.H., Hunt, Warren\u00a0A., J., Kaufmann, M., Schneider-Kamp, P.: Efficient certified RAT verification. In: de\u00a0Moura, L. (ed.) Proc. CADE. Lecture Notes in Computer Science, vol. 10395, pp. 220\u2013236 (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_14","DOI":"10.1007\/978-3-319-63046-5_14"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4), 543\u2013560 (2003). https:\/\/doi.org\/10.1016\/s1571-0661(05)82542-3","DOI":"10.1016\/s1571-0661(05)82542-3"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Fazekas, K., Niemetz, A., Preiner, M., Kirchweger, M., Szeider, S., Biere, A.: Satisfiability modulo user propagators. Journal of Artificial Intelligence Research 81, 989\u20131017 (2024). https:\/\/doi.org\/10.1613\/jair.1.16163","DOI":"10.1613\/jair.1.16163"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Fazekas, K., Pollitt, F., Fleury, M., Biere, A.: Certifying incremental SAT solving. In: Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR). vol.\u00a0100, pp. 321\u2013340 (2024). https:\/\/doi.org\/10.29007\/pdcc","DOI":"10.29007\/pdcc"},{"key":"18_CR12","unstructured":"Fazekas, K., Pollitt, F., Fleury, M., Biere, A.: Incremental inprocessing rules beyond resolution. In: Hoenicke, J., Janota, M., Niemetz, A., Tourret, S. (eds.) Proceedings 16\u2019th Pragmatics of SAT International Workshop (POS\u201925). pp. 190\u2013200. No.\u00a04008 in CEUR Workshop Proceedings (2025), https:\/\/ceur-ws.org\/Vol-4008"},{"issue":"6","key":"18_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/3560469","volume":"66","author":"JK Fichte","year":"2023","unstructured":"Fichte, J.K., Le\u00a0Berre, D., Hecher, M., Szeider, S.: The silent (r)evolution of SAT. Comm. ACM 66(6), 64\u201372 (2023). https:\/\/doi.org\/10.1145\/3560469","journal-title":"Comm. ACM"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Froleyks, N., Biere, A.: Single clause assumption without activation literals to speed-up IC3. In: Formal Methods in Computer Aided Design (FMCAD). pp. 72\u201376. IEEE (2021). https:\/\/doi.org\/10.34727\/2021\/isbn.978-3-85448-046-4_15","DOI":"10.34727\/2021\/isbn.978-3-85448-046-4_15"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Heisinger, M., Fleury, M., Biere, A.: Distributed cube and conquer with Paracooba. In: Theory and Applications of Satisfiability Testing (SAT). pp. 114\u2013122. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_9","DOI":"10.1007\/978-3-030-51825-7_9"},{"key":"18_CR16","unstructured":"Heule, M.J.H.: The DRAT format and DRAT-trim checker. CoRR abs\/1610.06229 (2016)"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H.: Proofs of unsatisfiability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 635\u2013668. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA200998","DOI":"10.3233\/FAIA200998"},{"key":"18_CR18","unstructured":"Heule, M.J.H., Biere, A.: Proofs for satisfiability problems. In: All about Proofs, Proofs for All (APPA), Math. Logic and Foundations, vol.\u00a055. College Pub. (2015)"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: Guiding CDCL SAT solvers by lookaheads. In: Haifa Verification Conference. pp. 50\u201365. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-34188-5_8","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"18_CR20","unstructured":"Heule, M.J., Iser, M., J\u00e4rvisalo, M., Suda, M.: Proceedings of SAT Competition 2024: Solver, benchmark and proof checker descriptions (2024), https:\/\/researchportal.helsinki.fi\/files\/324666039\/sc2024-proceedings.pdf"},{"key":"18_CR21","unstructured":"Hardware overview of HoreKa (2026), https:\/\/www.nhr.kit.edu\/userdocs\/horeka\/hardware\/"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Lammich, P.: Efficient verified (UN)SAT certificate checking. J. Autom. Reason. 64(3), 513\u2013532 (2020). https:\/\/doi.org\/10.1007\/s10817-019-09525-z","DOI":"10.1007\/s10817-019-09525-z"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Michaelson, D., Schreiber, D., Heule, M.J.H., Kiesl-Reiter, B., Whalen, M.W.: Unsatisfiability proofs for distributed clause-sharing SAT solvers. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS). pp. 348\u2013366. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30823-9_18","DOI":"10.1007\/978-3-031-30823-9_18"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Michaelson, D., Schreiber, D., Heule, M.J., Kiesl-Reiter, B., Whalen, M.W.: Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers. Journal of Automated Reasoning 69(2), \u00a012 (2025). https:\/\/doi.org\/10.1007\/s10817-025-09725-w","DOI":"10.1007\/s10817-025-09725-w"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Niemetz, A., Preiner, M.: Bitwuzla. In: International Conference on Computer Aided Verification (CAV). vol. 13965, pp. 3\u201317. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-37703-7_1","DOI":"10.1007\/978-3-031-37703-7_1"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Pollitt, F., Fleury, M., Biere, A.: Faster LRAT checking than solving with CaDiCaL. In: Theory and Applications of Satisfiability Testing (SAT). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2023.21","DOI":"10.4230\/LIPIcs.SAT.2023.21"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Sanders, P., Schreiber, D.: Decentralized online scheduling of malleable NP-hard jobs. In: Euro-Par 2022: Parallel Processing. pp. 119\u2013135. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-12597-3_8","DOI":"10.1007\/978-3-031-12597-3_8"},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Schrammel, P., Kroening, D.: 2LS for program analysis - (competition contribution). In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS). vol.\u00a09636, pp. 905\u2013907. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_56","DOI":"10.1007\/978-3-662-49674-9_56"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Schreiber, D.: Lilotane: A lifted SAT-based approach to hierarchical planning. JAIR 70, 1117\u20131181 (2021). https:\/\/doi.org\/10.1613\/jair.1.12520","DOI":"10.1613\/jair.1.12520"},{"key":"18_CR30","unstructured":"Schreiber, D.: MallobSat and MallobSat-ImpCheck in the SAT Competition 2024. In: SAT Competition 2024: Solver, Benchmark and Proof Checker Descriptions. pp. 21\u201322 (2024)"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Schreiber, D.: Trusted scalable SAT solving with on-the-fly LRAT checking. In: Theory and Applications of Satisfiability Testing (SAT). pp. 25:1\u201325:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2024.25","DOI":"10.4230\/LIPIcs.SAT.2024.25"},{"key":"18_CR32","unstructured":"Schreiber, D.: Distributed incremental SAT solving with Mallob: Report and case study with hierarchical planning. https:\/\/arxiv.org\/abs\/2505.18836 (2025)"},{"key":"18_CR33","doi-asserted-by":"publisher","unstructured":"Schreiber, D., Fleury, M., Fazekas, K., Biere, A.: Experimental data of TACAS 2026 publication \u201cReal-time Proof Checking for Distributed Incremental SAT Solving\u201d. Zenodo Dataset (2026). https:\/\/doi.org\/10.5281\/zenodo.18330440","DOI":"10.5281\/zenodo.18330440"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Schreiber, D., Jabs, C., Berg, J.: From scalable SAT to MaxSAT: Massively parallel solution improving search. In: Symposium on Combinatorial Search (SoCS) (2025). https:\/\/doi.org\/10.1609\/socs.v18i1.35984","DOI":"10.1609\/socs.v18i1.35984"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Schreiber, D., Niemetz, A., Preiner, M.: Massively parallel bit-precise verification with Bitwuzla and Mallob. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (2026), to appear","DOI":"10.1007\/978-3-032-22752-2_9"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Schreiber, D., Rigi-Luperti, N., Biere, A.: Streamlining distributed SAT solver design. Theory and Applications of Satisfiability Testing (SAT) 23, 1\u201323 (2025). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2025.27","DOI":"10.4230\/LIPIcs.SAT.2025.27"},{"key":"18_CR37","doi-asserted-by":"publisher","unstructured":"Schreiber, D., Sanders, P.: Scalable SAT solving in the cloud. In: Theory and Applications of Satisfiability Testing (SAT). pp. 518\u2013534. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_35","DOI":"10.1007\/978-3-030-80223-3_35"},{"key":"18_CR38","doi-asserted-by":"publisher","unstructured":"Schreiber, D., Sanders, P.: MallobSat: Scalable SAT solving by clause sharing. Journal of Artificial Intelligence Research 80, 1437\u20131495 (2024). https:\/\/doi.org\/10.1613\/jair.1.15827","DOI":"10.1613\/jair.1.15827"},{"key":"18_CR39","doi-asserted-by":"publisher","unstructured":"Tan, Y.K., Heule, M.J.H., Myreen, M.O.: cake_lpr: Verified propagation redundancy checking in CakeML. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS). pp. 223\u2013241. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_12","DOI":"10.1007\/978-3-030-72013-1_12"},{"key":"18_CR40","unstructured":"Van\u00a0Gelder, A.: Verifying RUP proofs of propositional unsatisfiability. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM) (2008), http:\/\/isaim2008.unl.edu\/PAPERS\/TechnicalProgram\/ISAIM2008_0008_60a1f9b2fd607a61ec9e0feac3f438f8.pdf"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:52:01Z","timestamp":1782874321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}