{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:13Z","timestamp":1725488473585},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424970"},{"type":"electronic","value":"9783540446859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_31","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:16:21Z","timestamp":1186726581000},"page":"456-471","source":"Crossref","is-referenced-by-count":6,"title":["Divide and Compose: SCC Refinement for Language Emptiness"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Roderick","family":"Bloem","sequence":"additional","affiliation":[]},{"given":"Gary D.","family":"Hachtel","sequence":"additional","affiliation":[]},{"given":"Kavita","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Somenzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"31_CR1","series-title":"Lect Notes Comput Sci","first-page":"37","volume-title":"Formal Methods in Computer Aided Design","author":"R. Bloem","year":"2000","unstructured":"R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in nlogn symbolic steps. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 37\u201354. Springer-Verlag, November 2000. LNCS 1954.","edition":"November"},{"key":"31_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/3-540-48683-6_21","volume-title":"Eleventh Conference on Computer Aided Verification (CAV\u201999)","author":"R. Bloem","year":"1999","unstructured":"R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In N. Halbwachs and D. Peled, editors, Eleventh Conference on Computer Aided Verification (CAV\u201999), pages 222\u2013235. Springer-Verlag, Berlin, 1999. LNCS 1633."},{"key":"31_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-61474-5_95","volume-title":"Eighth Conference on Computer Aided Verification (CAV\u201996)","author":"R. K. Brayton","year":"1996","unstructured":"R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV\u201996), pages 428\u2013432. Springer-Verlag, Rutgers University, 1996. LNCS 1102"},{"issue":"8","key":"31_CR4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Twelfth Conference on Computer Aided Verification (CAV\u201900)","author":"E. Clarke","year":"2000","unstructured":"E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In E. A. Emerson and A. P. Sistla, editors, Twelfth Conference on Computer Aided Verification (CAV\u201900), pages 154\u2013169. Springer-Verlag, Berlin, July 2000."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 126\u2013129, November 1990.","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"31_CR7","unstructured":"E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the First Annual Symposium of Logic in Computer Science, pages 267\u2013278, June 1986."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"R. Hojati, H. Touati, R. P. Kurshan, and R. K. Brayton. Efficient \u03c9-regular language containment. In Computer Aided Verification, pages 371\u2013382, Montr\u00e9al, Canada, June 1992.","DOI":"10.1007\/3-540-56496-9_31"},{"key":"31_CR9","unstructured":"J.-Y. Jang. Iterative Abstraction-based CTL Model Checking. PhD thesis, University of Colorado, Department of Electrical and Computer Engineering, 1999."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.","DOI":"10.1109\/LICS.1998.705645"},{"key":"31_CR11","volume-title":"Computer-Aided Verification of Coordinating Processes","author":"R. P. Kurshan","year":"1994","unstructured":"R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, January 1985.","DOI":"10.1145\/318593.318622"},{"key":"31_CR13","volume-title":"Symbolic Model Checking","author":"K. L. McMillan","year":"1994","unstructured":"K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"I.-H. Moon, J.-Y. Jang, G. D. Hachtel, F. Somenzi, C. Pixley, and J. Yuan. Approximate reachability don\u2019t cares for CTL model checking. In Proceedings of the International Conference on Computer-Aided Design, pages 351\u2013358, San Jose, CA, November 1998.","DOI":"10.1145\/288548.289053"},{"key":"31_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-40922-X_10","volume-title":"Formal Methods in Computer Aided Design","author":"K. Ravi","year":"2000","unstructured":"K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 143\u2013160. Springer-Verlag, November 2000. LNCS 1954."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"T. R. Shiple, R. Hojati, A. L. Sangiovanni-Vincentelli, and R. K. Brayton. Heuristic minimization of BDDs using don\u2019t cares. In Proceedings of the Design Automation Conference, pages 225\u2013231, San Diego, CA, June 1994.","DOI":"10.1145\/196244.196360"},{"key":"31_CR17","unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322\u2013331, Cambridge, UK, June 1986."},{"issue":"10","key":"31_CR18","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/43.875347","volume":"19","author":"A. Xie","year":"2000","unstructured":"A. Xie and P. A. Beerel. Implicit enumeration of strongly connected components and an application to formal verification. IEEE Transactions on Computer-Aided Design, 19(10):1225\u20131230, October 2000.","journal-title":"IEEE Transactions on Computer-Aided Design"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:33Z","timestamp":1556734293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}