{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:39Z","timestamp":1725544659488},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340638"},{"type":"electronic","value":"9783540340645"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11751113_14","type":"book-chapter","created":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T09:06:08Z","timestamp":1147856768000},"page":"190-202","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Case-Based Approach to LTL Model Checking"],"prefix":"10.1007","author":[{"given":"Fei","family":"Pu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaochun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-48153-2_17","volume-title":"Correct Hardware Design and Verification Methods","author":"K.L. McMillan","year":"1999","unstructured":"McMillan, K.L.: Verification of Infinite State Systems by Compositional Model Checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 219\u2013237. Springer, Heidelberg (1999)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48683-6_21","volume-title":"Computer Aided Verification","author":"R. Bloem","year":"1999","unstructured":"Bloem, R., Ravi, K., Somenzi, F.: Efficient Decision Procedures for Model Checking of Linear Time Logic Properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 222\u2013235. Springer, Heidelberg (1999)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-36577-X_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N. Amla","year":"2003","unstructured":"Amla, N., Kurshan, R., McMillan, K.L., Medel, R.: Experimental Analysis of Different Techniques for Bounded Model Checking. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 34\u201348. Springer, Heidelberg (2003)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1022905120346","volume":"22","author":"B.B. David","year":"2003","unstructured":"David, B.B., Eisner, C., Geist, D., Wolfsthal, Y.: Model Checking at IBM. Formal Methods in System Design\u00a022, 101\u2013108 (2003)","journal-title":"Formal Methods in System Design"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/B:FORM.0000033963.55470.9e","volume":"25","author":"K. Yorav","year":"2004","unstructured":"Yorav, K., Ogumber: Static Analysis for Stats-Space Reductions Preserving Temporal Logics. Formal Methods in System Design\u00a025, 67\u201396 (2004)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s100090050041","volume":"2","author":"L.I. Millett","year":"2000","unstructured":"Millett, L.I., Teitelbaum, T.: Issues in Slicing PROMELA and Its Application to Model Checking, Protocol Understanding, and Simulation. International Journal on Software Tools for Technology Transfer\u00a02(4), 343\u2013349 (2000)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"14_CR7","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"G.J. Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2004)"},{"key":"14_CR8","volume-title":"Model Checking","author":"E.M. Clark","year":"1999","unstructured":"Clark, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-46017-9_14","volume-title":"Model Checking Software","author":"P. Maggi","year":"2002","unstructured":"Maggi, P., Sisto, R.: Using SPIN to Verify Security Properties of Cryptographic Protocols. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol.\u00a02318, pp. 187\u2013204. Springer, Heidelberg (2002)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-44585-4_9","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Sistla, A.P.: Symmetric and Reduced Symmetry in Model Checking. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 91\u2013103. Springer, Heidelberg (2001)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s100090200074","volume":"4","author":"D. Bosnacki","year":"2002","unstructured":"Bosnacki, D., Dams, D., Holenderski, L.: Symmetric Spin. International Journal on Software Tools for Technology Transfer\u00a04, 92\u2013106 (2002)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0028727","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1998","unstructured":"Peled, D.: Ten Years of Partial Order Reduction. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 17\u201328. Springer, Heidelberg (1998)"},{"key":"14_CR14","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Proceedings of 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems(TACAS 1996)","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In: Proceedings of 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems(TACAS 1996). LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-49213-5_4","volume-title":"Compositionality: The Significant Difference","author":"S. Berezin","year":"1998","unstructured":"Berezin, S., Campos, S., Clarke, E.M.: Compositional Reasoning in Model Checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 81\u2013102. Springer, Heidelberg (1998)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and Modal Logic. Handbook of Theoretical Computer Science (B), 997\u20131072 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-30476-0_8","volume-title":"Automated Technology for Verification and Analysis","author":"B. Su","year":"2004","unstructured":"Su, B., Zhang, W.: Search Space Partition and Case Basis Exploration for Reducing Model Checking Complexity. In: Wang, F. (ed.) ATVA 2004. LNCS, vol.\u00a03299, pp. 34\u201348. Springer, Heidelberg (2004)"},{"issue":"6","key":"14_CR19","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/BF02945465","volume":"18","author":"W. Zhang","year":"2003","unstructured":"Zhang, W.: Combining Static Analysis and Case-Based Search Space Partition for Reducing Peek Memory in Model Checking. Journal of Computer Science and Technology\u00a018(6), 762\u2013770 (2003)","journal-title":"Journal of Computer Science and Technology"}],"container-title":["Lecture Notes in Computer Science","Rapid Integration of Software Engineering Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751113_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T16:24:03Z","timestamp":1548433443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751113_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340638","9783540340645"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11751113_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}