{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:58Z","timestamp":1725542938980},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377566"},{"type":"electronic","value":"9783540377580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823230_9","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:46:30Z","timestamp":1155822390000},"page":"127-143","source":"Crossref","is-referenced-by-count":5,"title":["Underapproximating Predicate Transformers"],"prefix":"10.1007","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: Proc. ACM Conf. PLDI, pp. 46\u201355 (2003)","DOI":"10.1145\/173262.155095"},{"issue":"5","key":"9_CR2","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":"9_CR3","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":"9_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":"9_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":"9_CR6","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":"9_CR7","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":"9_CR8","first-page":"12","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":"9_CR9","unstructured":"Dams, D.: Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands (1996)"},{"key":"9_CR10","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":"9_CR11","doi-asserted-by":"crossref","unstructured":"Dams, D., Namjoshi, K.: The existence of finite abstractions for branching time model checking. In: Proc. IEEE Symp. LICS 2004, pp. 335\u2013344 (2004)","DOI":"10.1109\/LICS.2004.1319628"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-30579-8_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D.R. Dams","year":"2005","unstructured":"Dams, D.R., Namjoshi, K.S.: Automata as abstractions. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 216\u2013232. Springer, Heidelberg (2005)"},{"key":"9_CR13","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., Priestly, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"9_CR14","unstructured":"Fecher, H., Huth, M.: Complete abstractions through extensions of disjunctive modal transition systems. Technical Report 0604, Institut f\u00fcr Informatik und Praktische Mathematik der Christian-Albrechts-Universitaet zu Kiel (2005)"},{"key":"9_CR15","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":"9_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00194-7","volume":"216","author":"R. Giacobazzi","year":"1999","unstructured":"Giacobazzi, R., Ranzato, F.: The reduced relative power operation on abstract domains. Theoretical Comp. Sci.\u00a0216, 159\u2013211 (1999)","journal-title":"Theoretical Comp. Sci."},{"key":"9_CR17","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":"9_CR18","unstructured":"Heckmann, R.: Power domain constructions. PhD thesis, Univ. Saarbr\u00fccken (1990)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026106","volume-title":"CAAP \u201988","author":"K. Larsen","year":"1988","unstructured":"Larsen, K.: Proof systems for Hennessy-Milner logic with recursion. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol.\u00a0299. Springer, Heidelberg (1988)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: LICS 1990 (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"9_CR21","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":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-44978-7_7","volume-title":"Programs as Data Objects","author":"D. Mass\u00e9","year":"2001","unstructured":"Mass\u00e9, D.: Combining forward and backward analyses of temporal properties. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 103\u2013172. Springer, Heidelberg (2001)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-36384-X_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Mass\u00e9","year":"2002","unstructured":"Mass\u00e9, D.: Property checking driven abstract interpretation-based static analysis. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 56\u201369. Springer, Heidelberg (2002)"},{"key":"9_CR24","unstructured":"Plotkin, G.: Domains. Lecture notes, Univ. Pisa\/Edinburgh (1983)"},{"key":"9_CR25","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":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-31980-1_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Ranzato","year":"2005","unstructured":"Ranzato, F., Tapparo, F.: An abstract interpretation-based refinement algorithm for strong preservation. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 140\u2013156. Springer, Heidelberg (2005)"},{"key":"9_CR27","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 by abstract interpretation. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 332\u2013347. Springer, Heidelberg (2005)"},{"key":"9_CR28","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":"9_CR29","volume-title":"Proc. 25th ACM Symp. on Principles of Prog. Languages","author":"D.A. Schmidt","year":"1998","unstructured":"Schmidt, D.A.: Data-flow analysis is model checking of abstract interpretations. In: Proc. 25th ACM Symp. on Principles of Prog. Languages. ACM Press, New York (1998)"},{"key":"9_CR30","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":"9_CR31","doi-asserted-by":"crossref","unstructured":"Schmidt, D.A.: A calculus of logical relations for over- and underapproximating static analyses. Science of Computer Programming (in press)","DOI":"10.1016\/j.scico.2006.03.008"},{"key":"9_CR32","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":"9_CR33","unstructured":"Shoham, S., Grumberg, O.: 3-valued abstraction: More precision at less cost. In: LICS 2006 (2006)"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0167-6423(93)90003-8","volume":"21","author":"B. Steffen","year":"1993","unstructured":"Steffen, B.: Generating data-flow analysis algorithms for modal specifications. Science of Computer Programming\u00a021, 115\u2013139 (1993)","journal-title":"Science of Computer Programming"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-60218-6_6","volume-title":"CONCUR \u201995 Concurrency Theory","author":"B. Steffen","year":"1995","unstructured":"Steffen, B., Classen, A., Klein, M., Knoop, J., Margaria, T.: The fixpoint analysis machine. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 72\u201387. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823230_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:09Z","timestamp":1605644229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823230_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377566","9783540377580"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11823230_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}