{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:53Z","timestamp":1762458533434},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439974"},{"type":"electronic","value":"9783540456575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45657-0_47","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T10:59:43Z","timestamp":1179572383000},"page":"555-568","source":"Crossref","is-referenced-by-count":37,"title":["Regular Tree Model Checking"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pritha","family":"Mahata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"d\u2019Orso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state space exploration. In O. Grumberg, editor, Proc. 9\n                           \n                    th\n                  \n                           Int. Conf. on Computer Aided Verification, volume 1254, pages 340\u2013351, Haifa, Israel, 1997. Springer Verlag.","DOI":"10.1007\/3-540-63166-6_34"},{"key":"47_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48683-6_14","volume-title":"Proc. 11th Int. Conf. on Computer Aided Verification","author":"P. A. Abdulla","year":"1999","unstructured":"Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In Proc. 11\n                           \n                    th\n                  \n                           Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134\u2013145, 1999."},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13\n                           \n                    th\n                  \n                           Int. Conf. on Computer Aided Verification, pages 221\u2013234, 2001.","DOI":"10.1007\/3-540-44585-4_19"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142\u2013170, 1992.","journal-title":"Information and Computation"},{"key":"47_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Proc. 12th Int. Conf. on Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Emerson and Sistla, editors, Proc. 12th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403\u2013418, 2000."},{"key":"47_CR6","unstructured":"A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and al-gorithmic verification. In Proc. LICS\u2019 01 17\n                           \n                    th\n                  \n                           IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001."},{"key":"47_CR7","unstructured":"H. Common, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. October 1999."},{"key":"47_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Computer Aided Verification","author":"D. Dams","year":"2001","unstructured":"D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, 2001."},{"key":"47_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 21th Conference on the Foundations of Software Technology and Theoretical Computer Science","author":"D. Fisman","year":"2001","unstructured":"Dana Fisman and Amir Pnueli. Beyond regular model checking. In Proc. 21th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, December 2001."},{"key":"47_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46419-0_16","volume-title":"Proc. TACAS\u2019 00, 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Jonsson","year":"2000","unstructured":"Bengt Jonsson and Marcus Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In S. Graf and M. Schwartzbach, editors, Proc. TACAS\u2019 00, 6\n                           \n                    th\n                  \n                           Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, 2000."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254, pages 424\u2013435, Haifa, Israel, 1997. Springer Verlag.","DOI":"10.1007\/3-540-63166-6_41"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(00)00103-1","volume":"256","author":"K.M.M.+.0.1._.Y. Kesten","year":"2001","unstructured":"Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256:93\u2013112, 2001.","journal-title":"Theoretical Computer Science"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"M. Maidl. A unifying model checking approach for safety properties of parameterized systems. In Proc. 13\n                           \n                    th\n                  \n                           Int. Conf. on Computer Aided Verification, pages 324\u2013336, 2001.","DOI":"10.1007\/3-540-44585-4_29"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45319-9_7","volume":"2031","author":"A. Pnueli","year":"2001","unstructured":"A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proc. TACAS\u2019 01, 7\n                           \n                    th\n                  \n                           Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031, pages 82\u201397, 2001.","journal-title":"Proc. TACAS\u2019 01, 7th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"47_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/10722167_26","volume-title":"Proc. 12th Int. Conf. on Computer Aided Verification","author":"A. Pnueli","year":"2000","unstructured":"A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. 12\n                           \n                    th\n                  \n                           Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 328\u2013343, 2000."},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001. Proc. Workshop on Verification of Parametrized Systems (VEPAS\u201901), Crete, July, 2001.","DOI":"10.1016\/S1571-0661(04)00187-2"},{"key":"47_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BFb0028736","volume-title":"Proc. 10th Int. Conf. on Computer Aided Verifi-cation","author":"P. Wolper","year":"1998","unstructured":"Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verifi-cation, volume 1427 of Lecture Notes in Computer Science, pages 88\u201397, Vancouver, July 1998. Springer Verlag."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45657-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:17:28Z","timestamp":1550330248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45657-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439974","9783540456575"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45657-0_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}