{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T04:56:05Z","timestamp":1744520165762},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423454"},{"type":"electronic","value":"9783540445852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44585-4_18","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:50Z","timestamp":1265917190000},"page":"207-220","source":"Crossref","is-referenced-by-count":46,"title":["Analysis of Recursive State Machines"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Kousha","family":"Etessami","sequence":"additional","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In Proc. 6th ACM Symp. on Found. of Software Engineering, pages 175\u2013188, 1998.","DOI":"10.1145\/288195.288305"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H. Andersen","year":"1994","unstructured":"H. Andersen. Model checking and boolean graphs. TCS, 126(1):3\u201330, 1994.","journal-title":"TCS"},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"SPIN\u20192000","author":"T. Ball","year":"2000","unstructured":"T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN\u20192000, volume 1885 of LNCS, pages 113\u2013130, 2000."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. To appear in ICALP\u20192001.","DOI":"10.1007\/3-540-48224-5_54"},{"key":"18_CR5","unstructured":"G. Booch, I. Jacobson, and J. Rumbaugh. The Unified Modeling Language User Guide. Addison Wesley, 1997."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR\u201997, pages 135\u2013150, 1997.","DOI":"10.1007\/3-540-63141-0_10"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(99)00034-1","volume":"221","author":"O. Burkart","year":"1999","unstructured":"O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science, 221:251\u2013270, 1999.","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Efficient algorithms for model checking pushdown systems","author":"J. Esparza","year":"2000","unstructured":"J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Computer Aided Verification, 12th Int. Conference, volume 1855 of LNCS, pages 232\u2013247. Springer, 2000."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In Infinity\u201997 Workshop, volume 9 of Electronic Notes in Theoretical Computer Science, 1997.","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"issue":"11\u201312","key":"18_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T. Reps","year":"1998","unstructured":"T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11\u201312):701\u2013726, 1998.","journal-title":"Information and Software Technology"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, pages 49\u201361, 1995.","DOI":"10.1145\/199448.199462"},{"key":"18_CR13","unstructured":"J. D. Ullman. Principles of Database and Knowledge-base systems. Computer Science Press, 1988."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant. General context-free recognition in less than cubic time. J. of Computer and System Sc., 10:308\u2013315, 1975.","journal-title":"J. of Computer and System Sc."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Graph-theoretic methods in database theory. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 230\u2013242, 1990.","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44585-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T22:29:23Z","timestamp":1558823363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44585-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423454","9783540445852"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44585-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}