{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:49:10Z","timestamp":1725504550149},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781622"},{"type":"electronic","value":"9783540781639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78163-9_23","type":"book-chapter","created":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T10:30:06Z","timestamp":1204281006000},"page":"263-278","source":"Crossref","is-referenced-by-count":4,"title":["Internal and External Logics of Abstract Interpretations"],"prefix":"10.1007","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45420-9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Ball","year":"2001","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Boolean and Cartesian Abstraction for Model Checking C Programs. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, Springer, Heidelberg (2001)"},{"key":"23_CR2","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. Clarke","year":"2000","unstructured":"Clarke, E., et al.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_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":"23_CR5","unstructured":"Cousot, P.: M\u00e9thodes it\u00e9ratives de construction et d\u2019approximation de points fixes d\u2019op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique de programmes. PhD thesis, University of Grenoble (1978)"},{"key":"23_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":"23_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":"23_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: mathematical foundations. In: Symp. Artificial Intelligence and Programming Languages ACM SIGART Newsletter 64 (1977)","DOI":"10.1145\/800228.806926"},{"key":"23_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":"23_CR10","unstructured":"Cousot, P., Cousot, R.: Higher-order abstract interpretation. In: Proceedings IEEE Int. Conf. Computer Lang. pp. 95\u2013112 (1994)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/325694.325699","volume-title":"Proc. 27th ACM Symp. on Principles of Programming Languages","author":"P. Cousot","year":"2000","unstructured":"Cousot, P., Cousot, R.: Temporal abstract interpretation. In: Proc. 27th ACM Symp. on Principles of Programming Languages, pp. 12\u201325. ACM Press, New York (2000)"},{"key":"23_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"23_CR13","volume-title":"Intuitionism","author":"M. Dummett","year":"1977","unstructured":"Dummett, M.: Intuitionism. Oxford University Press, Oxford (1977)"},{"key":"23_CR14","volume-title":"A Mathematical Introduction to Logic","author":"H. Enderton","year":"1972","unstructured":"Enderton, H.: A Mathematical Introduction to Logic. Academic Press, London (1972)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lacey, D., et al.: Proving correctness of compiler optimizations by temporal logic. In: Proc. 29th ACM POPL (2002)","DOI":"10.1145\/503272.503299"},{"key":"23_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542725","volume-title":"Continuous Lattices and Domains","author":"G. Gierz","year":"2003","unstructured":"Gierz, G., et al.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)"},{"key":"23_CR17","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":"23_CR18","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":"23_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1996","unstructured":"Graf, S., Saidi, H.: Verifying invariants using theorem proving. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, Springer, Heidelberg (1996)"},{"key":"23_CR20","volume-title":"Flow Analysis of Computer Programs","author":"M. Hecht","year":"1977","unstructured":"Hecht, M.: Flow Analysis of Computer Programs. Elsevier, Amsterdam (1977)"},{"key":"23_CR21","volume-title":"Handbook of Logic in Computer Science","author":"N. Jones","year":"1995","unstructured":"Jones, N., Nielson, F.: Abstract interpretation. In: Abramsky, S., et al. (eds.) Handbook of Logic in Computer Science, vol.\u00a04, Oxford University Press, Oxford (1995)"},{"volume-title":"Program Flow Analysis: Theory and Applications","year":"1981","key":"23_CR22","unstructured":"Muchnick, S., Jones, N.D. (eds.): Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Mycroft, A.: Completeness and predicate-based abstract interpretation. In: Proc. ACM Symp. Partial Evaluation (PEPM 1993), pp. 179\u2013185 (1993)","DOI":"10.1145\/154630.154648"},{"key":"23_CR24","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":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11609773_22","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Ranzato","year":"2005","unstructured":"Ranzato, F., Tapparo, F.: Strong preservation of temporal fixpoint-based operators. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 332\u2013347. Springer, Heidelberg (2005)"},{"key":"23_CR27","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":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-540-45099-3_20","volume-title":"Static Analysis","author":"H. Sa\u00efdi","year":"2000","unstructured":"Sa\u00efdi, H.: Model Checking Guided Abstraction and Analysis. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 377\u2013396. Springer, Heidelberg (2000)"},{"key":"23_CR29","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":"23_CR30","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)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78163-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:36Z","timestamp":1619521236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78163-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781622","9783540781639"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78163-9_23","relation":{},"subject":[]}}