{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:35:26Z","timestamp":1743143726389,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031711114"},{"type":"electronic","value":"9783031711121"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71112-1_6","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SAT-Based Automated Completion for\u00a0Reachability Analysis"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Hugot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Boiret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-70590-1_4","volume-title":"Rewriting Techniques and Applications","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., Courbis, R., H\u00e9am, P.-C., Kouchnarenko, O.: Finer is better: abstraction refinement for rewriting approximations. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 48\u201362. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70590-1_4"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-24288-5_8","volume-title":"Reachability Problems","author":"Y Boichut","year":"2011","unstructured":"Boichut, Y., Dao, T.-B.-H., Murat, V.: Characterizing conclusive approximations by logical formulae. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 72\u201384. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24288-5_8"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2008.03.012","volume":"108","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.-C.: A theoretical limit for safety verification techniques with regular fix-point computations. IPL 108(1), 1\u20132 (2008)","journal-title":"IPL"},{"issue":"3","key":"6_CR4","first-page":"216","volume":"14","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.-C., Kouchnarenko, O.: Approximation-based tree regular model-checking. Nord. J. Comput. 14(3), 216\u2013241 (2008)","journal-title":"Nord. J. Comput."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10009-011-0205-y","volume":"14","author":"A Bouajjani","year":"2012","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. STTT 14(2), 167\u2013191 (2012)","journal-title":"STTT"},{"key":"6_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA) (2007)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"3\u20134","key":"6_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-004-6246-0","volume":"33","author":"G Feuillade","year":"2004","unstructured":"Feuillade, G., Genet, T., Tong, V.V.T.: Reachability analysis over term rewriting systems. J. Autom. Reason. 33(3\u20134), 341\u2013383 (2004)","journal-title":"J. Autom. Reason."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1016\/j.jsc.2010.01.009","volume":"45","author":"T Genet","year":"2010","unstructured":"Genet, T., Rusu, V.: Equational Tree Automata Completion. J. Symb. Comput. 45, 2010 (2010)","journal-title":"J. Symb. Comput."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Rewriting Techniques and Applications","author":"T Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 151\u2013165. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0052368"},{"key":"6_CR11","unstructured":"Genet, Th.: Completeness of tree automata completion. In: FSCD 2018. LIPIcs, vol. 108, pp. 16:1\u201316:20 (2018)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-89366-2_31","volume-title":"Foundations of Software Science and Computation Structures","author":"T Genet","year":"2018","unstructured":"Genet, T., Haudebourg, T., Jensen, T.: Verifying higher-order functions with tree automata. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 565\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_31"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 271\u2013290. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721959_21"},{"key":"6_CR14","unstructured":"Genet, T.: Reachability analysis of rewriting for software verification. Habilitation thesis (habilitation \u00e0 diriger des recherches), University of Rennes I (2009)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability analysis of term rewriting systems with timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 695\u2013706. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45653-8_48"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"MJH Heule","year":"2012","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: guiding CDCL SAT solvers by lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol. 7261, pp. 50\u201365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34188-5_8"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-63166-6_41","volume-title":"Computer Aided Verification","author":"Y Resten","year":"1997","unstructured":"Resten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 424\u2013435. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_41"},{"key":"6_CR19","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual, January 2001. Notes Series NS-01-1. http:\/\/www.brics.dk\/mona\/"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71112-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:57Z","timestamp":1725328977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}