{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:49:44Z","timestamp":1725565784878},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540227915"},{"type":"electronic","value":"9783540278641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_5","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T12:35:37Z","timestamp":1284640537000},"page":"22-37","source":"Crossref","is-referenced-by-count":5,"title":["Closed and Logical Relations for Over- and Under-Approximation of Powersets"],"prefix":"10.1007","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","volume":"1","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: Abstract interpretation, logical relations, and Kan extensions. J. Logic and Computation\u00a01, 5\u201341 (1990)","journal-title":"J. Logic and Computation"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic\u00a051, 1\u201377 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR3","volume-title":"The Description Logic Handbook","author":"F. Baader","year":"2003","unstructured":"Baader, F., et al.: The Description Logic Handbook. Cambridge Univ. Press, Cambridge (2003)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-45442-X_4","volume-title":"Mathematics of Program Construction","author":"K. Backhouse","year":"2002","unstructured":"Backhouse, K., Backhous, R.: Galois connections and logical relations. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, p. 23. Springer, Heidelberg (2002)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Buneman, P., Davidson, S., Watters, A.: A semantics for complex objects and approximate queries. In: 7th ACM Symp. Principles of Database Systems (1988)","DOI":"10.1145\/308386.308463"},{"key":"5_CR6","unstructured":"Ciocoiu, M.: Ontology-based translation. PhD thesis, University of Maryland (2001)"},{"key":"5_CR7","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic and Computation\u00a02, 511\u2013547 (1992)","journal-title":"J. Logic and Computation"},{"key":"5_CR9","unstructured":"Cousot, P., Cousot, R.: Higher-order abstract interpretation. In: Proceedings IEEE Int. Conf. Computer Lang (1994)"},{"key":"5_CR10","unstructured":"Dams, D.: Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands (1996)"},{"key":"5_CR11","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 Trans. Prog. Lang. Systems\u00a019, 253\u2013291 (1997)","journal-title":"ACM Trans. Prog. Lang. Systems"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-47764-0_20","volume-title":"Static Analysis","author":"R. Giacobazzi","year":"2001","unstructured":"Giacobazzi, R., Quintarelli, E.: Incompleteness, counterexamples, and refinements in abstract model checking. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 356\u2013373. Springer, Heidelberg (2001)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(92)90017-A","volume":"103","author":"C. Gunter","year":"1992","unstructured":"Gunter, C.: The mixed power domain. Theoretical Comp. Sci.\u00a0103, 311\u2013334 (1992)","journal-title":"Theoretical Comp. Sci."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0019-9958(64)90181-0","volume":"7","author":"J. Hartmanis","year":"1964","unstructured":"Hartmanis, J., Stearns, R.E.: Pair algebras and their application to automata theory. J. Information and Control\u00a07, 485\u2013507 (1964)","journal-title":"J. Information and Control"},{"key":"5_CR15","unstructured":"Heckmann, R.: Power domain constructions. PhD thesis, Univ. Saarbr\u00fccken (1990)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-52592-0_63","volume-title":"Proc. European Symp. Programming","author":"R. Heckmann","year":"1990","unstructured":"Heckmann, R.: Set domains. In: Proc. European Symp. Programming. LNCS, pp. 177\u2013196. Springer, Heidelberg (1990)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M.C.B. Hennessy","year":"1985","unstructured":"Hennessy, M.C.B., Milner, R.: Algebraic laws for non-determinism and concurrency. JACM\u00a032, 137\u2013161 (1985)","journal-title":"JACM"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Proc. European Symp. Programming","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.A.: Modal transition systems: a foundation for three-valued program analysis. In: Proc. European Symp. Programming. LNCS, pp. 155\u2013169. Springer, Heidelberg (2001)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.A.: A domain equation for refinement of partial systems. Mathematical Structures in Computer Science (2004) (in press)","DOI":"10.1017\/S0960129504004268"},{"key":"5_CR20","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 mu-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for verification of concurrent systems. Formal Methods in System Design\u00a06, 1\u201336 (1995)","journal-title":"Formal Methods in System Design"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-16446-4_9","volume-title":"Programs as Data Objects","author":"A. Mycroft","year":"1986","unstructured":"Mycroft, A., Jones, N.D.: A relational framework for abstract interpretation. In: Ganzinger, H., Jones, N.D. (eds.) Programs as Data Objects. LNCS, vol.\u00a0217, pp. 156\u2013171. Springer, Heidelberg (1986)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","volume":"69","author":"F. Nielson","year":"1989","unstructured":"Nielson, F.: Two-level semantics and abstract interpretation. Theoretical Comp. Sci.\u00a069, 117\u2013242 (1989)","journal-title":"Theoretical Comp. Sci."},{"key":"5_CR25","unstructured":"Plotkin, G.: Domains. Lecture notes, Univ. Pisa\/Edinburgh (1983)"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-24725-8_3","volume-title":"Programming Languages and Systems","author":"F. Ranzato","year":"2004","unstructured":"Ranzato, F., Tapparo, F.: Strong preservation as completeness in abstract interpretation. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 18\u201332. Springer, Heidelberg (2004)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Proceedings 28th ACM POPL (1999)","DOI":"10.1145\/292540.292552"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36377-7_12","volume-title":"The Essence of Computation","author":"D.A. Schmidt","year":"2002","unstructured":"Schmidt, D.A.: Structure-preserving binary relations for program abstraction. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 246\u2013266. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27864-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:31:45Z","timestamp":1619998305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}