{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:32Z","timestamp":1762460252437},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678977"},{"type":"electronic","value":"9783540446187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_6","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"66-68","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Hierarchical Structure for Efficient Formal Verification"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-48320-9_8","volume-title":"Proc. of 10th CONCUR","author":"R. Alur","year":"1999","unstructured":"R. Alur, L. de Alfaro, T. Henzinger, and F. Mang. Automating modular verification. In Proc. of 10th CONCUR, LNCS 1664, pages 82\u201397, 1999."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur and R. Grosu. Modular refinement of hierarchic reactive machines. In Proc. of 27th POPL, pages 390\u2013402, 2000.","DOI":"10.1145\/325694.325746"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur, R. Grosu, and M. McDougall. Efficient reachability analysis of hierarchical reactive machines. In Proc. of 12th CAV, 2000.","DOI":"10.1007\/10722167_23"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7\u201348, 1999.","journal-title":"Formal Methods in System Design"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. of 38th FOCS, pages 100\u2013109, 1997.","DOI":"10.1109\/SFCS.1997.646098"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"R. Alur, S. Kannan, and M. Yannakakis. Communicating hierarchical state machines. In Proc. 26th ICALP, pages 169\u2013178. 1999.","DOI":"10.1007\/3-540-48523-6_14"},{"key":"6_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-48320-9_9","volume-title":"Proc. of 10th CONCUR","author":"R. Alur","year":"1999","unstructured":"R. Alur and B.-Y. Wang. \u201cNext\u201d heuristic for on-the-fly model checking. In Proc. of 10th CONCUR, LNCS 1664, pages 98\u2013113. Springer-Verlag, 1999."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In Proc. of 6th FSE, pages 175\u2013188. 1998.","DOI":"10.1145\/288195.288305"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/6.499951","volume":"33","author":"E. M. Clarke","year":"1996","unstructured":"E. M. Clarke and R. P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61\u201367, 1996.","journal-title":"IEEE Spectrum"},{"key":"6_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":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. J. Holzmann","year":"1997","unstructured":"G. J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279\u2013295, 1997.","journal-title":"IEEE Trans. on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:52:18Z","timestamp":1550875938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}