{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:04Z","timestamp":1725475684420},"publisher-location":"Boston, MA","reference-count":29,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34735-6_19","type":"book-chapter","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T18:32:32Z","timestamp":1166121152000},"page":"213-230","source":"Crossref","is-referenced-by-count":1,"title":["Regular Hedge Model Checking"],"prefix":"10.1007","author":[{"given":"Julien","family":"\u010fOrso","sequence":"first","affiliation":[]},{"given":"Tayssir","family":"Touili","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, A. Legay, J. \u010fOrso, and A. Rezine. Simulation-based iteration of tree transducers. Proceedings of TACAS\u201905, 2005.","DOI":"10.1007\/978-3-540-31980-1_3"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, and Julien \u010fOrso. Regular tree model checking. In Proc. 14 th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 555\u2013568, 2002.","DOI":"10.1007\/3-540-45657-0_47"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien \u010fOrso. Regular model checking made simple and efficient. In Proc. CONCUR 2002, 13 th Int. Conf. on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 116\u2013130, 2002.","DOI":"10.1007\/3-540-45694-5_9"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien \u010fOrso. Algorithmic improvements in regular model checking. In Proc. 15 th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 236\u2013248, 2003.","DOI":"10.1007\/978-3-540-45069-6_25"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bernard Boigelot, Axel Legay, and Pierre Wolper. Iterating transducers in the large. In Proc. 15 th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 223\u2013235, 2003.","DOI":"10.1007\/978-3-540-45069-6_24"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bernard Boigelot, Axel Legay, and Pierre Wolper. Omega regular model checking. In Proc. TACAS\u201904, 10 th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, pages 561\u2013575, 2004.","DOI":"10.1007\/978-3-540-24730-2_41"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"A. Bouajjani. Languages, Rewriting systems, and Verification of Infinte-State Systems. In ICALP\u201901. LNCS 2076, 2001. invited paper.","DOI":"10.1007\/3-540-48224-5_3"},{"key":"19_CR8","unstructured":"A. Bouajjani, J. Esparza, and T. Touili. Reachability Analysis of Synchronised PA systems. In INFINITY\u201901. ENTCS, 2004."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar. Verifying programs with dynamic 1-selector-linked structures in regular model checking. Proceedings of TACAS\u201905, 2005.","DOI":"10.1007\/978-3-540-31980-1_2"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar. Verifying programs with dynamic 1-selector-linked structures in regular model checking. In TACAS05, Lecture Notes in Computer Science, pages 13\u201329. Springer, 2005.","DOI":"10.1007\/978-3-540-31980-1_2"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. In CAV04, Lecture Notes in Computer Science, pages 372\u2013386, Boston, July 2004. Springer-Verlag.","DOI":"10.1007\/978-3-540-27813-9_29"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Emerson and Sistla, editors, Proc. 12 th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403\u2013418. Springer Verlag, 2000.","DOI":"10.1007\/10722167_31"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and algorithmic verification. In Proc. LICS\u2019 01 17 th IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001.","DOI":"10.1109\/LICS.2001.932515"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and T. Touili. Reachability analysis of process rewrite systems. In FSTTCS03, Lecture Notes in Computer Science, pages 73\u201387, 2003.","DOI":"10.1007\/978-3-540-24597-1_7"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and T. Touili. On computing reachability sets of process rewrite systems. In Proc. 16 th Int. Conf. on Rewriting Techniques and Applications (RTA\u201905), volume 3467 of Lecture Notes in Computer Science, April 2005.","DOI":"10.1007\/978-3-540-32033-3_35"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Ahmed Bouajjani, Markus Mfiller-Olm, and Tayssir Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR\u201905, LNCS, 2005.","DOI":"10.1007\/11539452_36"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Ahmed Bouajjani and Tayssir Touili. Extrapolating Tree Transformations. In Proc. 14 th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 539\u2013554, 2002.","DOI":"10.1007\/3-540-45657-0_46"},{"key":"19_CR18","unstructured":"A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets. Research report, 2001."},{"key":"19_CR19","doi-asserted-by":"crossref","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, pages 286\u2013297, 2001.","DOI":"10.1007\/3-540-44585-4_27"},{"key":"19_CR20","unstructured":"P. Habermehl and T. Vojnar. Regular model checking using inference of regular languages. In Proc. of 6th International Workshop on Verification of Infinite-State Systems\u2014Infinity\u201904, pages 61\u201372, Sept. 2004."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(00)00103-1","volume":"256","author":"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":"19_CR22","unstructured":"D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR\u201998), Nice, France, Sep. 1998, volume 1466, pages 50\u201366. Springer, 1998."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"A. Pnueli and E. Shahar. Liveness and acceleration in parametrized verification. In CAV\u201900. LNCS, 2000.","DOI":"10.1007\/10722167_26"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"H. Seidl, Th. Schwentick, and A. Muscholl. Numerical Document Queries. In PODS\u201903. ACM press, 2003.","DOI":"10.1145\/773153.773169"},{"key":"19_CR25","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":"19_CR26","unstructured":"T. Touili. Dealing with communication for dynamic multithreaded recursive programs. In 1st VISSAS workshop, 2005. Invited Paper."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for FIFO automata. In FSTTCS04, Lecture Notes in Computer Science, pages 494\u2013505, 2004.","DOI":"10.1007\/978-3-540-30538-5_41"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 88\u201397, Vancouver, July 1998. Springer Verlag.","DOI":"10.1007\/BFb0028736"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Silvano Dal Zilio and Denis Lugiez. Xml schema, tree logic and sheaves automata. In RTA\u201903, 2003.","DOI":"10.1007\/3-540-44881-0_18"}],"container-title":["IFIP International Federation for Information Processing","Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34735-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:50:27Z","timestamp":1619574627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34735-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346335"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34735-6_19","relation":{},"subject":[]}}