{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:18Z","timestamp":1725511998856},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709510"},{"type":"electronic","value":"9783540709527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70952-7_18","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T08:40:01Z","timestamp":1182847201000},"page":"277-292","source":"Crossref","is-referenced-by-count":5,"title":["SAT-Based Verification of LTL Formulas"],"prefix":"10.1007","author":[{"given":"Wenhui","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","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":"18_CR2","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimmatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded Model Checking. Advances in Computers 58 (2003)","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"18_CR3","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., Cimmatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"18_CR4","first-page":"428","volume-title":"IEEE Symposium on Logic in Computer Science, vol. 5","author":"J.R. Burch","year":"1990","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, J.: Symbolic model checking: 1020 states and beyond. In: IEEE Symposium on Logic in Computer Science, vol. 5, pp. 428\u2013439. IEEE, Los Alamitos (1990)"},{"issue":"8","key":"18_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph based algorithms for boolean function manipulation. IEEE Transaction on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transaction on Computers"},{"issue":"5","key":"18_CR6","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":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-540-24622-0_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E.M. Clarke","year":"2004","unstructured":"Clarke, E.M., Kroening, 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":"18_CR8","first-page":"353","volume-title":"IEEE Symposium on Logic in Computer Science, vol. 4","author":"E.M. Clarke","year":"1989","unstructured":"Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional Model Checking. In: IEEE Symposium on Logic in Computer Science, vol. 4, pp. 353\u2013362. IEEE, Los Alamitos (1989)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Das, S., Dill, D.L.: Successive Approximation of Abstract Transition Relations. LICS 2001, pp. 51-60 (2001)","DOI":"10.1109\/LICS.2001.932482"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1995","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods in System Design\u00a09, 105\u2013131 (1995)","journal-title":"Formal Methods in System Design"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Gregoire, J.: Verification Model Reduction through Abstraction. Formal Design Techniques VII, 280-282 (1995)","DOI":"10.1007\/978-0-387-34878-0_21"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computer Aided Verification","author":"R. Jhala","year":"2003","unstructured":"Jhala, R., 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":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36384-X_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Kroening","year":"2002","unstructured":"Kroening, D., Strichman, O.: Efficient Computation of Recurrence Diameters. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 298\u2013309. Springer, Heidelberg (2002)"},{"key":"18_CR14","first-page":"1","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Journal of Formal methods in System Design\u00a06, 1\u201335 (1995)","journal-title":"Journal of Formal methods in System Design"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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\u2013234. Springer, Heidelberg (1999)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Ruess, 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":"18_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3540-6","volume-title":"Software Reliability Methods","author":"D.A. Peled","year":"2001","unstructured":"Peled, D.A.: Software Reliability Methods. Springer, Heidelberg (2001)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"Pnueli, A.: A temporal logic of concurrent programs. Theoretical Computer Science\u00a013, 45\u201360 (1981)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"M.R. Prasad","year":"2005","unstructured":"Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. STTT\u00a07(2), 156\u2013173 (2005)","journal-title":"STTT"},{"key":"18_CR20","unstructured":"Roy, V., de Simone, R.: Auto\/Autograph. In: DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 3, pp. 235\u2013250 (June 1990)"},{"key":"18_CR21","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":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmaru","year":"1991","unstructured":"Valmaru, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) Advances in Petri Nets 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-57208-2_17","volume-title":"CONCUR\u201993","author":"P. Wolper","year":"1993","unstructured":"Wolper, P., Godefroid, P.: Partial-order methods for temporal verification. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 233\u2013246. Springer, Heidelberg (1993)"},{"issue":"6","key":"18_CR24","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 Partitioning for Reducing Peak Memory in Model Checking. Journal of Computer Science and Technology\u00a018(6), 762\u2013770 (2003)","journal-title":"Journal of Computer Science and Technology"},{"key":"18_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45683-X_14","volume-title":"PRICAI 2002: Trends in Artificial Intelligence","author":"W. Zhang","year":"2002","unstructured":"Zhang, W., Huang, Z., Zhang, J.: Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances. In: Ishizuka, M., Sattar, A. (eds.) PRICAI 2002. LNCS (LNAI), vol.\u00a02417, pp. 108\u2013117. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Applications and Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70952-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T08:40:01Z","timestamp":1550392801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70952-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709510","9783540709527"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70952-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}