{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T01:02:47Z","timestamp":1794358967535,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540883869","type":"print"},{"value":"9783540883876","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88387-6_35","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T01:42:45Z","timestamp":1223602965000},"page":"408-417","source":"Crossref","is-referenced-by-count":1,"title":["Practical Efficient Modular Linear-Time Model-Checking"],"prefix":"10.1007","author":[{"given":"Carlo A.","family":"Furia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paola","family":"Spoletini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"35_CR2","first-page":"996","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 996\u20131072. Elsevier Science, Amsterdam (1990)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Spoletini, P.: Practical efficient modular linear-time model-checking (July 2008); (extended version), http:\/\/home.dei.polimi.it\/furia\/","DOI":"10.1007\/978-3-540-88387-6_35"},{"key":"35_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Logics and Models of Concurrent Systems, pp. 477\u2013498 (1985)","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"35_CR6","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual (2003)"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/345099.345104","volume":"22","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: An automata-theortetic approach to modular model checking. ACM TOPLAS\u00a022(1), 87\u2013128 (2000)","journal-title":"ACM TOPLAS"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/inco.2000.2893","volume":"164","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Information and Computation\u00a0164(2), 322\u2013344 (2001)","journal-title":"Information and Computation"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-45236-2_30","volume-title":"FME 2003: Formal Methods","author":"A. Morzenti","year":"2003","unstructured":"Morzenti, A., Pradella, M., San Pietro, P., Spoletini, P.: Model-checking TRIO specifications in SPIN. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol.\u00a02805, pp. 542\u2013561. Springer, Heidelberg (2003)"},{"issue":"12","key":"35_CR10","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1145\/361598.361623","volume":"15","author":"D.L. Parnas","year":"1972","unstructured":"Parnas, D.L.: On the criteria to be used in decomposing systems into modules. Communications of the ACM\u00a015(12), 1053\u20131058 (1972)","journal-title":"Communications of the ACM"},{"key":"35_CR11","unstructured":"Pradella, M., San Pietro, P., Spoletini, P., Morzenti, A.: Practical model checking of LTL with past. In: ATVA 2003, pp. 135\u2013146 (2003)"},{"key":"35_CR12","unstructured":"Spoletini, P.: Verification of Temporal Logic Specification via Model Checking. PhD thesis, DEI, Politecnico di Milano (May 2005)"},{"key":"35_CR13","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013164. Elsevier Science, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88387-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T10:45:34Z","timestamp":1557830734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88387-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540883869","9783540883876"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88387-6_35","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-88387-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}