{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:46:35Z","timestamp":1794336395199,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291893","type":"print"},{"value":"9783540320845","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11562436_10","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T05:40:51Z","timestamp":1129700451000},"page":"113-127","source":"Crossref","is-referenced-by-count":8,"title":["Proving \u2200\u03bc-Calculus Properties with SAT-Based Model Checking"],"prefix":"10.1007","author":[{"given":"Bow-Yaw","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without bDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"10_CR2","first-page":"317","volume-title":"Proceedings of the 36th Design Automation Conference (DAC 1999)","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model check- ing using SAT procedures instead of BDDs. In: Proceedings of the 36th Design Automation Conference (DAC 1999), pp. 317\u2013320. ACM Press, New York (1999)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. Emerson","year":"1982","unstructured":"Emerson, E., Clarke, E.: Using branching-time temporal logic to synthesize syn- chronization skeletons. Science of Computer Programming\u00a02, 241\u2013266 (1982)","journal-title":"Science of Computer Programming"},{"key":"10_CR4","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-24622-0_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kr\u00f6ning, D., Ouaknine, J., Strichman, O.: Completeness and complexity of bounded model checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 85\u201396. Springer, Heidelberg (2004)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-45069-6_2","volume-title":"Computer Aided Verification","author":"L. Moura de","year":"2003","unstructured":"de Moura, L., Rue\u00df, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 14\u201326. Springer, Heidelberg (2003)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-27813-9_8","volume-title":"Computer Aided Verification","author":"M. Awedh","year":"2004","unstructured":"Awedh, M., Somenzi, F.: Proving more properties with bounded model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 96\u2013108. Springer, Heidelberg (2004)"},{"key":"10_CR10","first-page":"267","volume-title":"Proceedings First Annual IEEE Symposium on Logic in Computer Science","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.L.: Eficient model-checking in fragments of the propositional mu-calculus. In: Proceedings First Annual IEEE Symposium on Logic in Computer Science, pp. 267\u2013278. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"10_CR11","first-page":"332","volume-title":"Proceedings First Annual IEEE Symposium on Logic in Computer Science","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings First Annual IEEE Symposium on Logic in Computer Science, pp. 332\u2013344. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation\u00a098, 142\u2013170 (1992)","journal-title":"Information and Computation"},{"key":"10_CR13","first-page":"725","volume":"27","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R.: Tableau-based model checking in the propositional mu-calculus. Acta Informatica\u00a027, 725\u2013747 (1989)","journal-title":"Acta Informatica"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","volume":"89","author":"C. Stirling","year":"1991","unstructured":"Stirling, C., Walker, D.: Local model checking in the modal mu-calculus. Theoretical Computer Science\u00a089, 161\u2013177 (1991)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/LICS.1994.316076","volume-title":"Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R., Stirling, C., Winskel, G.: A compositional proof system for the modal \u03bc-calculus. In: Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, pp. 144\u2013153. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"10_CR16","first-page":"84","volume-title":"Proceedings of the 12th ACM Symposium on Principles of Programming Languages","author":"E. Emerson","year":"1985","unstructured":"Emerson, E., Lei, C.: Modalities for model-checking: Branching time logic strikes back. In: Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pp. 84\u201396. ACM Press, New York (1985)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-003-0121-x","volume":"5","author":"V. Schuppan","year":"2004","unstructured":"Schuppan, V., Biere, A.: Eficient reduction of finite state model checking to reachability analysis. Software Tools for Technology Transfer\u00a05, 185\u2013204 (2004)","journal-title":"Software Tools for Technology Transfer"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Schuele, T., Schneider, K.: Global vs. local model checking: A comparison of verification techniques for infinite state systems. In: International Conference on Soft- ware Engineering and Formal Methods (SEFM), Beijing. IEEE Computer Society Press, Los Alamitos (2004)","DOI":"10.1109\/SEFM.2004.1347504"},{"key":"10_CR19","unstructured":"Schuele, T., Schneider, K.: Bounded local model checking. Private communication (2005)"},{"key":"10_CR20","unstructured":"Wang, B.Y.: Unbounded model checking with sat - a local model checking approach. unpublished manuscript (2004)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(91)90043-2","volume":"83","author":"G. Winskel","year":"1991","unstructured":"Winskel, G.: A note on model checking the modal nu-calculus. Theoretical Computer Science\u00a083, 157\u2013167 (1991)","journal-title":"Theoretical Computer Science"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Wang, B.Y.: Proving \u2200 \u03bc-calculus properties with sat-based model checking. Technical Report TR-IIS-05-003, Institute of Information Science, Academia Sinica (2005), http:\/\/www.iis.sinica.edu.tw\/LIB\/TechReport\/tr2005\/tr05003.pdf","DOI":"10.1007\/11562436_10"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-58179-0_72","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"1994","unstructured":"Clarke, E., Grumberg, O., Hamaguchi, K.: Another look at LTL model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 415\u2013428. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems - FORTE 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562436_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T06:40:25Z","timestamp":1586500825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562436_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291893","9783540320845"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11562436_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11562436","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}