{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:10:01Z","timestamp":1760044201663},"reference-count":46,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2389,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1016\/j.scico.2006.03.008","type":"journal-article","created":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T09:34:08Z","timestamp":1159522448000},"page":"29-53","source":"Crossref","is-referenced-by-count":18,"title":["A calculus of logical relations for over- and underapproximating static analyses"],"prefix":"10.1016","volume":"64","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.scico.2006.03.008_b1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","article-title":"Abstract interpretation, logical relations, and Kan extensions","volume":"1","author":"Abramsky","year":"1990","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.scico.2006.03.008_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.scico.2006.03.008_b3","series-title":"The Essence of Computation","article-title":"Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software","volume":"vol. 2566","author":"Blanchet","year":"2002"},{"key":"10.1016\/j.scico.2006.03.008_b4","series-title":"The Description Logic Handbook","author":"Baader","year":"2003"},{"key":"10.1016\/j.scico.2006.03.008_b5","series-title":"Mathematics of Program Construction","article-title":"Galois connections and logical relations","volume":"vol. 2386","author":"Backhouse","year":"2002"},{"key":"10.1016\/j.scico.2006.03.008_b6","doi-asserted-by":"crossref","unstructured":"P. Buneman, S. Davidson, A. Watters, A semantics for complex objects and approximate queries, in: 7th ACM Symp. Principles of Database Systems, 1988","DOI":"10.1145\/308386.308463"},{"key":"10.1016\/j.scico.2006.03.008_b7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher-order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/j.scico.2006.03.008_b8","series-title":"Model Checking","author":"Clarke","year":"2000"},{"key":"10.1016\/j.scico.2006.03.008_b9","series-title":"Proc. 4th ACM Symp. on Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: A unified lattice model for static analysis of programs","author":"Cousot","year":"1977"},{"key":"10.1016\/j.scico.2006.03.008_b10","series-title":"Proc. 6th ACM Symp. on Principles of Programming Languages","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"key":"10.1016\/j.scico.2006.03.008_b11","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","article-title":"Abstract interpretation frameworks","volume":"2","author":"Cousot","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.scico.2006.03.008_b12","unstructured":"P. Cousot, R. Cousot, Higher-order abstract interpretation, in: Proceedings IEEE Int. Conf. Computer Lang., 1994"},{"key":"10.1016\/j.scico.2006.03.008_b13","unstructured":"D. Dams, Abstract interpretation and partition refinement for model checking, Ph.D. Thesis, Technische Universiteit Eindhoven, The Netherlands, 1996"},{"key":"10.1016\/j.scico.2006.03.008_b14","unstructured":"D. Dams, Personal communication, 2004"},{"key":"10.1016\/j.scico.2006.03.008_b15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/244795.244800","article-title":"Abstract interpretation of reactive systems","volume":"19","author":"Dams","year":"1997","journal-title":"ACM Trans. Prog. Lang. Systems"},{"key":"10.1016\/j.scico.2006.03.008_b16","series-title":"Introduction to Lattices and Order","author":"Davey","year":"2002"},{"key":"10.1016\/j.scico.2006.03.008_b17","series-title":"Summer Conference on General Topology and Applications","first-page":"103","article-title":"A primer on Galois connections","volume":"vol. 704","author":"Ern\u00e9","year":"1993"},{"key":"10.1016\/j.scico.2006.03.008_b18","series-title":"Static Analysis Symposium","first-page":"356","article-title":"Incompleteness, counterexamples, and refinements in abstract model checking","volume":"vol. 2126","author":"Giacobazzi","year":"2001"},{"key":"10.1016\/j.scico.2006.03.008_b19","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/333979.333989","article-title":"Making abstract interpretations complete","volume":"47","author":"Giacobazzi","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2006.03.008_b20","series-title":"Symp. Princ. of Programming Languages","article-title":"Proof-guided underapproximation\u2013widening for multi-process systems","author":"Grumberg","year":"2005"},{"key":"10.1016\/j.scico.2006.03.008_b21","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(92)90017-A","article-title":"The mixed power domain","volume":"103","author":"Gunter","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.scico.2006.03.008_b22","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0019-9958(64)90181-0","article-title":"Pair algebras and their application to automata theory","volume":"7","author":"Hartmanis","year":"1964","journal-title":"J. Inf. Control"},{"key":"10.1016\/j.scico.2006.03.008_b23","series-title":"Flow Analysis of Computer Programs","author":"Hecht","year":"1977"},{"key":"10.1016\/j.scico.2006.03.008_b24","unstructured":"R. Heckmann, Power domain constructions, Ph.D. Thesis, Univ. Saarbr\u00fccken, 1990"},{"key":"10.1016\/j.scico.2006.03.008_b25","series-title":"Proc. European Symp. Programming","first-page":"177","article-title":"Set domains","author":"Heckmann","year":"1990"},{"key":"10.1016\/j.scico.2006.03.008_b26","series-title":"Mathematical Foundations of Computer Science","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","volume":"vol. 74","author":"Hennessy","year":"1979"},{"key":"10.1016\/j.scico.2006.03.008_b27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for non-determinism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2006.03.008_b28","series-title":"Proc. European Symp. Programming","first-page":"155","article-title":"Modal transition systems: A foundation for three-valued program analysis","author":"Huth","year":"2001"},{"key":"10.1016\/j.scico.2006.03.008_b29","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1017\/S0960129504004268","article-title":"A domain equation for refinement of partial systems","volume":"14","author":"Huth","year":"2004","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.scico.2006.03.008_b30","first-page":"527","article-title":"Abstract interpretation: A semantics-based tool for program analysis","volume":"vol. 4","author":"Jones","year":"1995"},{"key":"10.1016\/j.scico.2006.03.008_b31","unstructured":"P. Kelb, Model checking and abstraction: A framework preserving both truth and failure information, Technical Report, OFFIS, University of Oldenburg, Germany, 1994"},{"key":"10.1016\/j.scico.2006.03.008_b32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01384313","article-title":"Property preserving abstractions for verification of concurrent systems","volume":"6","author":"Loiseaux","year":"1995","journal-title":"Form. Methods Syst. Des."},{"key":"10.1016\/j.scico.2006.03.008_b33","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/j.scico.2006.03.008_b34","series-title":"Programs as Data Objects","first-page":"156","article-title":"A relational framework for abstract interpretation","volume":"vol. 217","author":"Mycroft","year":"1985"},{"key":"10.1016\/j.scico.2006.03.008_b35","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","article-title":"Two-level semantics and abstract interpretation","volume":"69","author":"Nielson","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.scico.2006.03.008_b36","series-title":"Principles of Program Analysis","author":"Nielson","year":"1999"},{"key":"10.1016\/j.scico.2006.03.008_b37","first-page":"167","article-title":"Concurrency and Automata in Infinite Strings","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/j.scico.2006.03.008_b38","series-title":"Computer-Aided Verification","article-title":"Concrete model checking with abstract matching and refinement","author":"Pas\u00e4reanu","year":"2005"},{"key":"10.1016\/j.scico.2006.03.008_b39","unstructured":"G. Plotkin, Domains, Lecture notes, Univ. Pisa, Edinburgh, 1983"},{"key":"10.1016\/j.scico.2006.03.008_b40","series-title":"Proc. European Symp. Programming","first-page":"18","article-title":"Strong preservation as completeness in abstract interpretation","volume":"vol. 2986","author":"Ranzato","year":"2004"},{"key":"10.1016\/j.scico.2006.03.008_b41","series-title":"Proc. 11th Conf. on Tools and Algs. for Const. and Anal. of Systems","first-page":"140","article-title":"An abstract-interpretation-based refinement algorithm for strong preservation","volume":"vol. 3440","author":"Ranzato","year":"2005"},{"key":"10.1016\/j.scico.2006.03.008_b42","doi-asserted-by":"crossref","unstructured":"M. Sagiv, T. Reps, R. Wilhelm, Parametric shape analysis via 3-valued logic, in: Proceedings 28th ACM POPL, 1999","DOI":"10.1145\/292540.292552"},{"key":"10.1016\/j.scico.2006.03.008_b43","series-title":"The Essence of Computation","first-page":"246","article-title":"Structure-preserving binary relations for program abstraction","volume":"vol. 2566","author":"Schmidt","year":"2002"},{"key":"10.1016\/j.scico.2006.03.008_b44","series-title":"Static Analysis Symposium","first-page":"22","article-title":"Closed and logical relations for over- and under-approximation of powersets","volume":"vol. 3148","author":"Schmidt","year":"2004"},{"key":"10.1016\/j.scico.2006.03.008_b45","doi-asserted-by":"crossref","first-page":"209","DOI":"10.2140\/pjm.1974.54.209","article-title":"The structure of Galois connections","volume":"54","author":"Shmuely","year":"1974","journal-title":"Pacific J. Math."},{"key":"10.1016\/j.scico.2006.03.008_b46","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System Sci."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167642306001560?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167642306001560?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T15:27:31Z","timestamp":1547306851000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642306001560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["S0167642306001560"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.scico.2006.03.008","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}