{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:09Z","timestamp":1760202609140},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253334"},{"type":"electronic","value":"9783540319801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31980-1_6","type":"book-chapter","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T18:44:59Z","timestamp":1278873899000},"page":"77-92","source":"Crossref","is-referenced-by-count":13,"title":["Empirically Efficient Verification for a Class of Infinite-State Systems"],"prefix":"10.1007","author":[{"given":"Jesse","family":"Bingham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan J.","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pp. 160\u2013170 (1993)","key":"6_CR1","DOI":"10.1109\/LICS.1993.287591"},{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems for infinite-state systems. In: 10th Annual IEEE Symp. on Logic in Computer Science (LICS 1996), pp. 313\u2013321 (1996)","key":"6_CR2","DOI":"10.1109\/LICS.1996.561359"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44585-4_34","volume-title":"Computer Aided Verification","author":"A. Annichini","year":"2001","unstructured":"Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, p. 368. Springer, Heidelberg (2001)"},{"unstructured":"Bingham, J.: A new approach to upward closed set backward reachability analysis. In: 6th International Workshop on Verification of Infinite-State Systems, INFINITY (2004)","key":"6_CR4"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-31980-1_6","volume-title":"Extended electronic version of this paper","author":"J. Bingham","year":"2005","unstructured":"Bingham, J., Hu, A.J.: Empirically efficient verification for a class of infinite-state systems. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 77\u201392. Springer, Heidelberg (2005), \n                    \n                      http:\/\/www.springerlink.com\/"},{"issue":"8","key":"6_CR6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers C"},{"doi-asserted-by":"crossref","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(2) (1992)","key":"6_CR7","DOI":"10.1016\/0890-5401(92)90017-A"},{"doi-asserted-by":"crossref","unstructured":"Chou, C.T., Mannava, P.K., Park, S.: A simple method for parameterized verification of cache coherence protocols. Formal Methods in Computer-Aided Design (2004)","key":"6_CR8","DOI":"10.1007\/978-3-540-30494-4_27"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"6_CR10","volume-title":"Parallel Computer Architecture: A Hardware\/Software Approach","author":"D.E. Culler","year":"1998","unstructured":"Culler, D.E., Singh, J.P., Gupta, A.: Parallel Computer Architecture: A Hardware\/Software Approach. Morgan Kaufmann, San Francisco (1998)"},{"doi-asserted-by":"crossref","unstructured":"Delzanno, G.: Automatic verification of parameterized cache coherence protocols. In: Proceedings of the 12th International Conference on Computer Aided Verification (July 2000)","key":"6_CR11","DOI":"10.1007\/10722167_8"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-46419-0_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G., Raskin, J.F.: Symbolic representation of upward-closed sets. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 426\u2013440. Springer, Heidelberg (2000)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44585-4_28","volume-title":"Computer Aided Verification","author":"G. Delzanno","year":"2001","unstructured":"Delzanno, G., Raskin, J.F., Van Begin, L.: Attacking symbolic state explosion. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 298\u2013310. Springer, Heidelberg (2001)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-39724-3_22","volume-title":"Correct Hardware Design and Verification Methods","author":"E.A. Emerson","year":"2003","unstructured":"Emerson, E.A., Kahlon, V.: Exact and efficient verification of parameterized cache coherence protocols. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol.\u00a02860, pp. 247\u2013262. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Kahlon, V.: Model checking guarded protocols. In: Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 361\u2013370 (June 2003)","key":"6_CR15","DOI":"10.1109\/LICS.2003.1210076"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-36577-X_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.A. Emerson","year":"2003","unstructured":"Emerson, E.A., Kahlon, V.: Rapid parameterized model checking of snoopy cache protocols. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 144\u2013159. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: Proceedings of LICS 1998, pp. 70\u201380 (1998)","key":"6_CR17","DOI":"10.1109\/LICS.1998.705644"},{"doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proceedings of LICS 1999, pp. 352\u2013359 (1999)","key":"6_CR18","DOI":"10.1109\/LICS.1999.782630"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"Finkel, A.: Reduction and covering of infinite reachability trees. Information and Computation\u00a089(2), 144\u2013179 (1990)","journal-title":"Information and Computation"},{"issue":"1-2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"unstructured":"Ganty, P., Van Begin, L.: Non deterministic automata for the efficient verification of infinite-state. In: Presented at: CP+CV Workshop at European Joint Conferences on Theory and Practice of Software, ETAPS (2004)","key":"6_CR21"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-30538-5_24","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"G. Geeraerts","year":"2004","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 287\u2013298. Springer, Heidelberg (2004)"},{"unstructured":"German, S.: Personal correspondence (2003)","key":"6_CR23"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s100090050008","volume":"1","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer\u00a01, 110\u2013122 (1997)","journal-title":"Software Tools for Technology Transfer"},{"issue":"7","key":"6_CR25","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3)\u00a02(7), 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society (3)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-24622-0_22","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S.K. Lahiri","year":"2004","unstructured":"Lahiri, S.K., Bryant, R.E.: Constructing quantified invariants via predicate abstraction. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 267\u2013281. Springer, Heidelberg (2004)"},{"key":"6_CR27","volume-title":"Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers","author":"L. Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addision-Wesley, London (2002)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45319-9_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Pnueli","year":"2001","unstructured":"Pnueli, A., Ruah, S., Zuck, L.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 82\u201397. Springer, Heidelberg (2001)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","first-page":"337","volume-title":"5th International Symposium on Programming","author":"J.-P. Queille","year":"1981","unstructured":"Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in Cesar. In: Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1981)"},{"unstructured":"Somenzi, F.: Colorado university decision diagram package (CUDD) webpage, \n                    \n                      http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html","key":"6_CR30"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31980-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:44:39Z","timestamp":1619999079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31980-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253334","9783540319801"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31980-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}