{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:25Z","timestamp":1763467945500},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03237-0_20","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T01:24:37Z","timestamp":1249262677000},"page":"293-308","source":"Crossref","is-referenced-by-count":4,"title":["Abstract Interpretation from a Topological Perspective"],"prefix":"10.1007","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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":"20_CR2","doi-asserted-by":"crossref","unstructured":"Benton, N.: Strictness logic and polymorphic invariance. In: Proc. Logical Found. Comp. Sci, pp. 33\u201344 (1992)","DOI":"10.1007\/BFb0023861"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"20_CR4","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":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60360-3_32","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":"20_CR6","first-page":"303","volume-title":"Program Flow Analysis","author":"P. Cousot","year":"1981","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis, pp. 303\u2013342. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs. In: Proc. 4th ACM Symp. POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"20_CR8","first-page":"238","volume-title":"Formal Description of Programming Concepts","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Neuhold, E.J. (ed.) Formal Description of Programming Concepts, pp. 238\u2013277. North-Holland, Amsterdam (1978)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proc. 6th ACM Symp. POPL, pp. 269\u2013282 (1979)","DOI":"10.1145\/567752.567778"},{"key":"20_CR10","unstructured":"Cousot, P., Cousot, R.: Higher-order abstract interpretation. In: Proceedings IEEE Int. Conf. Computer Lang. (1994)"},{"key":"20_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":"20_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0890-5401(91)90004-L","volume":"90","author":"P. Dybjer","year":"1991","unstructured":"Dybjer, P.: Inverse image analysis generalises strictness analysis. Information and Computation\u00a090, 194\u2013216 (1991)","journal-title":"Information and Computation"},{"key":"20_CR13","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":"20_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. J. ACM\u00a047, 361\u2013416 (2000)","journal-title":"J. ACM"},{"key":"20_CR15","first-page":"633","volume-title":"Handbook of Theoretical Computer Science","author":"C. Gunter","year":"1991","unstructured":"Gunter, C., Scott, D.S.: Semantic domains. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 633\u2013674. MIT Press, Cambridge (1991)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Hunt, S.: Frontiers and open sets in abstract intepretation. In: Proc. ACM Symp. Functional Prog. and Comp. Architecture, pp. 194\u2013216 (1989)","DOI":"10.1145\/99370.99371"},{"key":"20_CR17","unstructured":"Jensen, T.: Abstract Interpretation in Logical Form. PhD thesis, Imperial College, London (1992)"},{"key":"20_CR18","volume-title":"Stone Spaces","author":"P. Johnstone","year":"1986","unstructured":"Johnstone, P.: Stone Spaces. Cambridge University Press, Cambridge (1986)"},{"key":"20_CR19","unstructured":"Reynolds, J.C.: Notes on a lattice-theoretic approach to the theory of computation. Technical report, Computer Science, Syracuse University (1972)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM TOPLAS\u00a024, 217\u2013298 (2002)","journal-title":"ACM TOPLAS"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11924661_12","volume-title":"Programming Languages and Systems","author":"D.A. Schmidt","year":"2006","unstructured":"Schmidt, D.A.: Comparing completeness properties of static analyses and their logics. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol.\u00a04279, pp. 183\u2013199. Springer, Heidelberg (2006)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11823230_9","volume-title":"Static Analysis","author":"D.A. Schmidt","year":"2006","unstructured":"Schmidt, D.A.: Underapproximating predicate transformers. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 127\u2013143. Springer, Heidelberg (2006)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.scico.2006.03.008","volume":"64","author":"D.A. Schmidt","year":"2007","unstructured":"Schmidt, D.A.: A calculus of logical relations for over- and underapproximating static analyses. Science of Computer Programming\u00a064, 29\u201353 (2007)","journal-title":"Science of Computer Programming"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"Smyth, M.B.: Effectively given domains. Theoretical Comp. Sci.\u00a05, 257\u2013274 (1977)","journal-title":"Theoretical Comp. Sci."},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/BFb0036946","volume-title":"Automata, Languages and Programming","author":"M.B. Smyth","year":"1983","unstructured":"Smyth, M.B.: Powerdomains and predicate transformers: a topological view. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 662\u2013675. Springer, Heidelberg (1983)"},{"key":"20_CR26","unstructured":"Willard, S.: General Topology. Dover Publications (2004)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:33:15Z","timestamp":1558456395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}