{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:51:15Z","timestamp":1725573075123},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242970"},{"type":"electronic","value":"9783540305798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30579-8_15","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T11:45:34Z","timestamp":1292845534000},"page":"216-232","source":"Crossref","is-referenced-by-count":15,"title":["Automata as Abstractions"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Dams","sequence":"first","affiliation":[]},{"given":"Kedar S.","family":"Namjoshi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Computer Aided Verification","author":"G. Bruns","year":"1999","unstructured":"Bruns, G., Godefroid, P.: Model checking partial state spaces with 3-valued temporal logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 274\u2013287. Springer, Heidelberg (1999)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45251-6_5","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"M. Chechik","year":"2001","unstructured":"Chechik, M., Easterbrook, S., Petrovykh, V.: Model-Checking over Multi-valued Logics. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, p. 72. Springer, Heidelberg (2001)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1981","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. Springer, Heidelberg (1981)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"R. Cleaveland","year":"1995","unstructured":"Cleaveland, R., Iyer, P., Yankelevich, D.: Optimality in abstractions of model checking. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983. Springer, Heidelberg (1995)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)","DOI":"10.1145\/512950.512973"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dams, D., Namjoshi, K.S.: The existence of finite abstractions for branching time model checking. In: LICS (2004)","DOI":"10.1109\/LICS.2004.1319628"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM TOPLAS\u00a019(2), 253\u2013291 (1997)","journal-title":"ACM TOPLAS"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dams, D., Lakhnech, Y., Steffen, M.: Iterating transducers. J. of Logic and Algebraic Programming, 52\u201353, 109\u2013127 (2002)","DOI":"10.1016\/S1567-8326(02)00025-5"},{"key":"15_CR9","unstructured":"Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis (July 1996)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Godefroid, P., Jagadeesan, R.: Three-valued abstractions of games: Uncertainty, but with precision. In: LICS (2004)","DOI":"10.1109\/LICS.2004.1319611"},{"key":"#cr-split#-15_CR11.1","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: FOCS (1988);","DOI":"10.1109\/SFCS.1988.21949"},{"key":"#cr-split#-15_CR11.2","doi-asserted-by":"crossref","unstructured":"Full version in SIAM Journal of Computing, 29(1), 132\u2013158 (1999)","DOI":"10.1137\/S0097539793304741"},{"key":"15_CR12","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS (1991)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-36384-X_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Godefroid","year":"2002","unstructured":"Godefroid, P., Jagadeesan, R.: On the expressiveness of 3-valued models. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 206\u2013222. Springer, Heidelberg (2002)"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R. Giacobazzi","year":"2000","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. Journal of the ACM\u00a047(2), 361\u2013416 (2000)","journal-title":"Journal of the ACM"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. In: ACM TOPLAS (1994)","DOI":"10.1145\/177492.177725"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201997: Concurrency Theory","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.: Fair simulation. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243. Springer, Heidelberg (1997)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, p. 155. Springer, Heidelberg (2001)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal mu-calulus and related results. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969. Springer, Heidelberg (1995)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119. Springer, Heidelberg (1996)"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/inco.2000.3000","volume":"163","author":"Y. Kesten","year":"2000","unstructured":"Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Information and Computation\u00a0163(1), 203\u2013243 (2000)","journal-title":"Information and Computation"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-49213-5_14","volume-title":"Compositionality: The Significant Difference","author":"O. Kupferman","year":"1998","unstructured":"Kupferman, O., Vardi, M.Y.: Modular model checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, p. 381. Springer, Heidelberg (1998)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS (1988)","DOI":"10.1109\/LICS.1988.5119"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: LICS (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"15_CR24","volume-title":"2nd IJCAI","author":"R. Milner","year":"1971","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: 2nd IJCAI. William Kaufmann, San Francisco (1971)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-45069-6_29","volume-title":"Computer Aided Verification","author":"K.S. Namjoshi","year":"2003","unstructured":"Namjoshi, K.S.: Abstraction for branching time properties. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 288\u2013300. Springer, Heidelberg (2003)"},{"key":"15_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137. Springer, Heidelberg (1982)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-27864-1_5","volume-title":"Static Analysis","author":"D.A. Schmidt","year":"2004","unstructured":"Schmidt, D.A.: Closed and logical relations for over- and under-approximation of powersets. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 22\u201337. Springer, Heidelberg (2004)"},{"key":"15_CR29","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal of Computing\u00a019, 424\u2013437 (1990)","journal-title":"SIAM Journal of Computing"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Shoham","year":"2004","unstructured":"Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 546\u2013560. Springer, Heidelberg (2004)"},{"key":"#cr-split#-15_CR31.1","doi-asserted-by":"crossref","unstructured":"Streett, R.S., Emerson, E.A.: The propositional mu-calculus is elementary. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172. Springer, Heidelberg (1984), pp. 249\u2013264. Springer, Heidelberg (1984);","DOI":"10.1007\/3-540-13345-3_43"},{"key":"#cr-split#-15_CR31.2","doi-asserted-by":"crossref","unstructured":"Full version in information and computation 81(3), 249\u2013264 (1989)","DOI":"10.1016\/0890-5401(89)90031-X"},{"key":"15_CR32","unstructured":"Uribe, T.E.: Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University (1999)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30579-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:15Z","timestamp":1605741855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30579-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242970","9783540305798"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30579-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}