{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:36Z","timestamp":1775873676668,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433699","type":"print"},{"value":"9783540459378","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45937-5_13","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:39:18Z","timestamp":1181180358000},"page":"159-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":79,"title":["Modular Static Program Analysis"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Cousot","sequence":"first","affiliation":[]},{"given":"Radhia","family":"Cousot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,28]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-44716-4_20","volume-title":"Proc. FLOPS 2001 Conf.","author":"G. Amato","year":"2001","unstructured":"G. Amato and F. Spoto. Abstract compilation for sharing analysis. In H. Kuchen and K. Ueda (eds), Proc. FLOPS 2001 Conf., LNCS 2024, 311\u2013325. Springer, 2001."},{"key":"13_CR2","first-page":"25","volume-title":"25th POPL","author":"B. Blanchet","year":"1998","unstructured":"B. Blanchet. Escape analysis: Correctness proof, implementation and experimental results. In 25 th POPL, 25\u201337, San Diego, 1998. ACM Press."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"B. Blanchet. Escape analysis for object-oriented languages: Application to Java. In Proc. ACM SIGPLAN Conf. OOPSLA\u2019 99. ACM SIGPLAN Not. 34(10), 1999.","DOI":"10.1145\/320385.320387"},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-61053-7_62","volume-title":"Proc. 6th Int. Conf. CC\u201996","author":"D. Boucher","year":"1996","unstructured":"D. Boucher and M. Feeley. Abstract compilation: A new implementation paradigm for static analysis. In T. Gyimothy (ed), Proc. 6 th Int. Conf. CC\u201996, LNCS 1060, 192\u2013207. Springer, 1996."},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Proc. FMPA","author":"F. Bourdoncle","year":"1993","unstructured":"F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In D. Bj\u00f8rner, M. Broy, and I.V. Pottosin (eds), Proc. FMPA, LNCS 735, 128\u2013141. Springer, 1993."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/292540.292554","volume-title":"26th POPL","author":"R. Chatterjee","year":"1999","unstructured":"R. Chatterjee, B.G. Ryder, and W. Landi. Relevant context inference. In 26 th POPL, 133\u2013146, San Antonio, 1999. ACM Press. 170"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"R. Chatterjee, B.G. Ryder, and W. Landi. Relevant context inference. Tech. rep. DCS-TR-360, Rutgers University, 1999. ftp:\/\/athos.rutgers.edu\/pub\/technical-reports\/dcs-tr-360.ps.Z .","DOI":"10.1145\/292540.292554"},{"key":"13_CR8","first-page":"451","volume-title":"20th POPL","author":"M. Codish","year":"1993","unstructured":"M. Codish, S. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In 20 th POPL, 451\u2013464, Charleston, 1993. ACM Press."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-58485-4_47","volume-title":"Proc. 1st Int. Symp. SAS\u2019 94","author":"M. Codish","year":"1994","unstructured":"M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop. In B. Le Charlier (ed), Proc. 1 st Int. Symp. SAS\u2019 94, LNCS 864, 281\u2013296. Springer, 1994."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"P. Colette and C.B. Jones. Enhancing the tractability of rely\/guarantee specifications in the development of interfering operations. In G. Plotkin, C. Stirling, and M. Tofte (eds), Proof, Language and Interaction, ch. 10, 277\u2013307. MIT Press, 2000.","DOI":"10.7551\/mitpress\/5641.003.0016"},{"key":"13_CR11","unstructured":"P. Cousot. M\u00e9thodes it\u00e9ratives de construction et d\u2019approximation de points fixes d\u2019op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique de programmes. Th\u00e8se d\u2019\u00c9tat \u00e8s sciences math\u00e9matiques, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, 21 Mar. 1978."},{"key":"13_CR12","unstructured":"P. Cousot. Semantic foundations of program analysis. In S.S. Muchnick and N.D. Jones (eds), Program Flow Analysis: Theory and Applications, ch. 10, 303\u2013342. Prentice-Hall, 1981."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"P. Cousot. Methods and logics for proving programs. In J. van Leeuwen (ed), Formal Models and Semantics, vol. B of Handbook of Theoretical Computer Science, ch. 15, 843\u2013993. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50020-2"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/263699.263744","volume-title":"24th POPL","author":"P. Cousot","year":"1997","unstructured":"P. Cousot. Types as abstract interpretations, invited paper. In 24 th POPL, 316\u2013331, Paris, 1997. ACM Press."},{"key":"13_CR15","unstructured":"P. Cousot. The calculational design of a generic abstract interpreter. In M. Broy and R. Steinbr\u00fcggen (eds), Calculational System Design, vol. 173, 421\u2013505. NATO Science Series, Series F: Computer and Systems Sciences. IOS Press, 1999."},{"key":"13_CR16","series-title":"Lect Notes Comput Sci","first-page":"138","volume-title":"Informatics \u2014 10 Years Back, 10 Years Ahead","author":"P. Cousot","year":"2000","unstructured":"P. Cousot. Abstract interpretation based formal methods and future challenges, invited paper. In R. Wilhelm (ed), \u201cInformatics \u2014 10 Years Back, 10 Years Ahead\u201d, LNCS 2000, 138\u2013156. Springer, 2000."},{"key":"13_CR17","first-page":"238","volume-title":"4th POPL","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4 th POPL, 238\u2013252, Los Angeles, 1977. ACM Press."},{"issue":"8","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800228.806926","volume":"12","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: mathematical foundations. In ACM Symposium on Artificial Intelligence & Programming Languages, ACM SIGPLAN Not. 12(8):1\u201312, 1977.","journal-title":"ACM Symposium on Artificial Intelligence & Programming Languages"},{"issue":"3","key":"13_CR19","first-page":"77","volume":"12","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Static determination of dynamic properties of generalized type unions. In ACM Symposium on Language Design for Reliable Software, AC M SIGPLAN Not. 12(3):77\u201394, 1977.","journal-title":"ACM Symposium on Language Design for Reliable Software"},{"key":"13_CR20","unstructured":"P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In E.J. Neuhold (ed), IFIP Conf. on Formal Description of Programming Concepts, St-Andrews, CA, 237\u2013277. North-Holland, 1977."},{"key":"13_CR21","first-page":"269","volume-title":"6th POPL","author":"P. Cousot","year":"1979","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6 th POPL, 269\u2013282, San Antonio, 1979. ACM Press."},{"key":"13_CR22","first-page":"33","volume":"74","author":"P. Cousot","year":"1991","unstructured":"P. Cousot and R. Cousot. Relational abstract interpretation of higher-order functional programs. Actes JTASPEFL\u2019 91, Bordeaux, FR. BIGRE, 74:33\u201336, 1991.","journal-title":"Actes JTASPEFL\u2019 91"},{"issue":"2\u20133","key":"13_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. Logic Programming, 13(2\u20133):103\u2013179, 1992. (The editor of J. Logic Programming has mistakenly published the unreadable galley proof. For a correct version of this paper, see http:\/\/www.di.ens.fr\/~cousot .).","journal-title":"J. Logic Programming"},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Comp., 2(4):511\u2013547, Aug. 1992.","journal-title":"J. Logic and Comp."},{"key":"13_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BFb0039703","volume-title":"Proc. FMPA","author":"P. Cousot","year":"1993","unstructured":"P. Cousot and R. Cousot. Galois connection based abstract interpretations for strictness analysis, invited paper. In D. Bj\u00f8rner, M. Broy, and I.V. Pottosin (eds), Proc. FMPA, LNCS 735, 98\u2013127. Springer, 1993."},{"key":"13_CR26","series-title":"Lect Notes Comput Sci","first-page":"93","volume-title":"Proc. 7th Int. Conf. CAV\u201995","author":"P. Cousot","year":"1995","unstructured":"P. Cousot and R. Cousot. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper. In P. Wolper (ed), Proc. 7 th Int. Conf. CAV\u201995, LNCS 939, 93\u2013308. Springer, 1995."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/224164.224199","volume-title":"Proc. 7th FPCA","author":"P. Cousot","year":"1995","unstructured":"P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proc. 7 th FPCA, 170\u2013181, La Jolla, 1995. ACM Press."},{"key":"13_CR28","unstructured":"P. Cousot and R. Cousot. Introduction to abstract interpretation. Course notes for the \u201cNATO Int. Summer School 1998 on Calculational System Design\u201d, Marktoberdorff, 1998."},{"key":"13_CR29","unstructured":"P. Cousot and R. Cousot. Abstract interpretation based program testing, invited paper. In Proc. SSGRR 2000 Computer & eBusiness International Conference, Compact disk paper 248 and electronic proceedings http:\/\/www.ssgrr.it\/en\/ssgrr2000\/proceedings.htm , 2000. Scuola Superiore G. Reiss Romoli."},{"key":"13_CR30","first-page":"178","volume-title":"29th POPL","author":"P. Cousot","year":"2002","unstructured":"P. Cousot and R. Cousot. Systematic Design of Program Transformation Frameworks by Abstract Interpretation. In 29 th POPL, 178\u2013190, Portland, 2002. ACM Press."},{"key":"13_CR31","first-page":"84","volume-title":"5th POPL","author":"P. Cousot","year":"1978","unstructured":"P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5 th POPL, 84\u201397, Tucson, 1978. ACM Press."},{"key":"13_CR32","series-title":"Lect Notes Comput Sci","first-page":"259","volume-title":"Proc. 8th Int. Symp. SAS\u2019 01","author":"M. Das","year":"2001","unstructured":"M. Das, B. Liblit, M. F\u00e4hndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In P. Cousot (ed), Proc. 8> th Int. Symp. SAS\u2019 01, LNCS 2126, 259\u2013277. Springer, 2001."},{"key":"13_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-49538-X_5","volume-title":"Optimization of object-oriented programs using static class hierarchy analysis","author":"J. Dean","year":"1995","unstructured":"J. Dean, Grove D., and G. Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In W.G. Olthoff (ed), Proc. 9 th Euro. Conf. ECOOP\u201995, LNCS 952, 77\u2013101. Springer, 1995."},{"issue":"3","key":"13_CR34","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S.K. Debray","year":"1988","unstructured":"S.K. Debray and D.S. Warren. Automatic mode inference for logic programs. J. Logic Programming, 5(3):207\u2013229, 1988.","journal-title":"J. Logic Programming"},{"issue":"6","key":"13_CR35","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/178243.178264","volume":"28","author":"M. Emami","year":"1994","unstructured":"M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural pointsto analysis in the presence of function pointers. In Proc. ACM SIGPLAN\u201993 Conf. PLDI. ACM SIGPLAN Not. 28(6), 242\u2013256, 1994. ACM Press.","journal-title":"Proc. ACM SIGPLAN\u201993 Conf. PLDI"},{"key":"13_CR36","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 7th Int. Symp. SAS\u2019 2000","author":"M. Felleisen","year":"2000","unstructured":"M. Felleisen. Program analyses: A consumer\u2019s perspective and experiences, invited talk. In J. Palsberg (ed), Proc. 7 th Int. Symp. SAS\u2019 2000, LNCS 1824. Springer, 2000. Presentation available at URL http:\/\/www.cs.rice.edu:80\/~matthias\/Presentations\/SAS.ppt ."},{"key":"13_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-45099-3_8","volume-title":"Proc. 7th Int. Symp. SAS\u2019 2000","author":"J. Feret","year":"2000","unstructured":"J. Feret. Confidentiality analysis of mobile systems. In J. Palsberg (ed), Proc. 7 th Int. Symp. SAS\u2019 2000, LNCS 1824, 135\u2013154. Springer, 2000."},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/316686.316703","volume":"21","author":"C. Flanagan","year":"1999","unstructured":"C. Flanagan and M. Felleisen. Componential set-based analysis. TOPLAS, 21(2):370\u2013416, Feb. 1999.","journal-title":"TOPLAS"},{"key":"13_CR39","first-page":"193","volume-title":"28th POPL","author":"C. Flanagan","year":"2001","unstructured":"C. Flanagan and J.B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In 28 th POPL, 193\u2013205, London, Jan. 2001. ACM Press."},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"R.W. Floyd. Assigning meaning to programs. In J.T. Schwartz (ed), Proc. Symposium in Applied Mathematics, vol. 19, 19\u201332. AMS, 1967.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"13_CR41","first-page":"121","volume-title":"25th POPL","author":"R. Ghiya","year":"1998","unstructured":"R. Ghiya and L.J. Hendren. Putting pointer analysis to work. In 25 th POPL, 121\u2013133, San Diego, Jan. 1998. ACM Press."},{"key":"13_CR42","first-page":"377","volume-title":"Proc. Int. Symp. ILPS\u2019 1994","author":"R. Giacobazzi","year":"1994","unstructured":"R. Giacobazzi. Abductive analysis of modular logic programs. In M. Bruynooghe (ed), Proc. Int. Symp. ILPS\u2019 1994, Ithaca, 377\u2013391. MIT Press, 1994."},{"key":"13_CR43","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-47764-0_20","volume-title":"Proc. 8th Int. Symp. SAS\u2019 01","author":"R. Giacobazzi","year":"2001","unstructured":"R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples and refinements in abstract model-checking. In P. Cousot (ed), Proc. 8 th Int. Symp. SAS\u2019 01, LNCS 2126, 356\u2013373. Springer, 2001."},{"key":"13_CR44","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/3-540-63165-8_230","volume-title":"Proc. 24th Int. Coll. ICALP\u201997","author":"R. Giacobazzi","year":"1997","unstructured":"R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. 24 th Int. Coll. ICALP\u201997, LNCS 1256, 771\u2013781. Springer, 1997."},{"issue":"2","key":"13_CR45","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R. Giacobazzi","year":"2000","unstructured":"R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. J. ACM, 47(2):361\u2013416, 2000.","journal-title":"J. ACM"},{"key":"13_CR46","unstructured":"N. Halbwachs. D\u00e9termination automatique de relations lin\u00e9aires v\u00e9rifi\u00e9es par les variables d\u2019un programme. Th\u00e8se de 3\u00e8me cycle d\u2019informatique, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, Grenoble, 12 Mar. 1979."},{"issue":"2\u20133","key":"13_CR47","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(95)00012-7","volume":"25","author":"C. Hankin","year":"1995","unstructured":"C. Hankin and D. Le M\u00e9tayer. Lazy type inference and program analysis. Sci. Comput. Programming, 25(2\u20133):219\u2013249, 1995.","journal-title":"Sci. Comput. Programming"},{"key":"13_CR48","unstructured":"M.J. Harrold, D. Liang, and S. Sinha. An approach to analyzing and testing component-based systems. In Proc. 1 st Int. ICSE Workshop on Testing Distributed Component-Based Systems. Los Angeles, 1999."},{"issue":"2","key":"13_CR49","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/174662.174663","volume":"16","author":"M.J. Harrold","year":"1994","unstructured":"M.J. Harrold and M.L. Soffa. Efficient computation of interprocedural definitionuse chains. TOPLAS, 16(2):175\u2013204, Mar. 1994.","journal-title":"TOPLAS"},{"issue":"4","key":"13_CR50","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M. Hind","year":"1999","unstructured":"M. Hind, M. Burke, P. Carini, and J.-D. Choi. Interprocedural pointer alias analysis. TOPLAS, 21(4):848\u2013894, Jul. 1999.","journal-title":"TOPLAS"},{"key":"13_CR51","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-49727-7_4","volume-title":"Proc. 5th Int. Symp. SAS\u2019 98","author":"M. Hind","year":"1998","unstructured":"M. Hind and A. Pioli. Assessing the effects of flow-sensitivity on pointer alias analyses. In G. Levi (ed), Proc. 5 th Int. Symp. SAS\u2019 98, LNCS 1503, 57\u201381. Springer, 1998."},{"issue":"1","key":"13_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/239912.239913","volume":"19","author":"S. Horwitz","year":"1997","unstructured":"S. Horwitz. Precise flow-insensitive may-alias analysis is NP-hard. TOPLAS, 19(1):1\u20136, Jan. 1997.","journal-title":"TOPLAS"},{"key":"13_CR53","first-page":"329","volume-title":"25th POPL","author":"S. Jagannathan","year":"1998","unstructured":"S. Jagannathan, P. Thiemann, S. Weeks, and A.K. Wright. Single and loving it: Must-alias analysis for higher-order languages. In 25 th POPL, 329\u2013341, San Diego, Jan. 1998. ACM Press."},{"key":"13_CR54","unstructured":"N. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Int. Series in Computer Science. Prentice-Hall, June 1993."},{"key":"13_CR55","first-page":"17","volume-title":"29th POPL","author":"V. Kuncak","year":"2002","unstructured":"V. Kuncak, P. Lam, and M. Rinard. Role analysis. In 29 th POPL, 17\u201332, Portland, Jan. 2002. ACM Press."},{"issue":"4","key":"13_CR56","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/161494.161501","volume":"1","author":"W.A. Landi","year":"1992","unstructured":"W.A. Landi. Undecidability of static analysis. ACM Lett. Prog. Lang. Syst., 1(4):323\u2013337, Dec. 1992.","journal-title":"ACM Lett. Prog. Lang. Syst."},{"key":"13_CR57","unstructured":"O. Lee and K. Yi. A proof method for the correctness of modularized kCFAs. Technical Memorandum ROPAS-2000-9, Research On Program Analysis System, Korea Advanced Institute of Science and Technology, Nov. 2000. http:\/\/ropas.kaist.ac.kr\/~cookcu\/paper\/tr2000b.ps.gz ."},{"key":"13_CR58","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-48166-4_13","volume-title":"Software Engineering-ESEC\/FSE\u201999, 7th European Software Engineering Conference","author":"D. Liang","year":"1999","unstructured":"D. Liang and M.J. Harrold. Efficient points-to analysis for whole-program analysis. In O. Nierstrasz and M. Lemoine (eds), Software Engineering-ESEC\/FSE\u201999, 7 th European Software Engineering Conference, LNCS 1687, 199\u2013215, 1999."},{"key":"13_CR59","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-47764-0_16","volume-title":"Proc. 8th Int. Symp. SAS\u2019 01","author":"D. Liang","year":"2001","unstructured":"D. Liang and M.J. Harrold. Efficient computation of parameterized pointer information for interprocedural analyses. In P. Cousot (ed), Proc. 8th Int. Symp. SAS\u2019 01, LNCS 2126, 279\u2013298. Springer, 2001."},{"key":"13_CR60","unstructured":"F. Mal\u00e9sieux, O. Ridoux, and P. Boizumault. Abstract compilation of Lambda-Prolog. In J. Jaffar (ed), JICSLP\u2019 98, Manchester, 130\u2013144. MIT Press, 1992."},{"key":"13_CR61","series-title":"Lect Notes Comput Sci","first-page":"155","volume-title":"Proc. 2nd Symp. PADO\u20192001","author":"D. Mass\u00e9","year":"2001","unstructured":"D. Mass\u00e9. Combining forward and backward analyzes of temporal properties. In O. Danvy and A. Filinski (eds), Proc. 2 nd Symp. PADO\u20192001, LNCS 2053, 155\u2013172. Springer, 2001."},{"issue":"1","key":"13_CR62","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-6423(96)00042-1","volume":"31","author":"L. Mauborgne","year":"1998","unstructured":"L. Mauborgne. Abstract interpretation using typed decision graphs. Sci. Comput. Programming, 31(1):91\u2013112, May 1998.","journal-title":"Sci. Comput. Programming"},{"key":"13_CR63","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-44978-7_10","volume-title":"Proc. 2nd Symp. PADO\u20192001","author":"A. Min\u00e9","year":"2001","unstructured":"A. Min\u00e9. A new numerical abstract domain based on difference-bound matrices. In O. Danvy and A. Filinski (eds), Proc. 2 nd Symp. PADO\u20192001, LNCS 2053, 155\u2013172. Springer, 2001."},{"issue":"5","key":"13_CR64","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1145\/186025.186041","volume":"16","author":"G. Ramalingam","year":"1994","unstructured":"G. Ramalingam. The undecidability of aliasing. TOPLAS, 16(5):1467\u20131471, Sep. 1994.","journal-title":"TOPLAS"},{"key":"13_CR65","volume-title":"Proceedings DASIA 2000-DAta Systems In Aerospace","author":"F. Randimbivololona","year":"2000","unstructured":"F. Randimbivololona, J. Souyris, and A. Deutsch. Improving avionics software verification cost-effectiveness: Abstract interpretation based technology contribution. In Proceedings DASIA 2000-DAta Systems In Aerospace, Montreal. ESA Publications, May 2000."},{"issue":"5","key":"13_CR66","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/358438.349310","volume":"35","author":"A. Rountev","year":"2000","unstructured":"A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Proc. ACM SIGPLAN\u201900 Conf. PLDI. ACM SIGPLAN Not. 35(5), 47\u201356, Vancouver, June 2000.","journal-title":"Proc. ACM SIGPLAN\u201900 Conf. PLDI. ACM SIGPLAN Not."},{"key":"13_CR67","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/3-540-45306-7_3","volume-title":"Proc. 10th Int. Conf. CC\u20192001","author":"A. Rountev","year":"2001","unstructured":"A. Rountev and B. Ryder. Points-to and side-effect analyses for programs built with precompiled libraries. In R. Wilhelm (ed), Proc. 10 th Int. Conf. CC\u20192001, LNCS 2027, 20\u201336. Springer, 2001."},{"key":"13_CR68","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-48166-4_15","volume-title":"Software Engineering-ESEC\/FSE\u201999, 7th European Software Engineering Conference","author":"A. Rountev","year":"1999","unstructured":"A. Rountev, B.G. Ryder, and W. Landi. Data-flow analysis of program fragments. In O. Nierstrasz and M. Lemoine (eds), Software Engineering-ESEC\/FSE\u201999, 7th European Software Engineering Conference, LNCS 1687, 235\u2013252. Springer, 1999."},{"key":"13_CR69","doi-asserted-by":"crossref","unstructured":"B.G. Ryder, W. Landi, P.A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural side effect analysis with pointer aliasing. TOPLAS, 2002. To appear.","DOI":"10.1145\/383043.381532"},{"key":"13_CR70","doi-asserted-by":"crossref","unstructured":"O. Shivers. The semantics of scheme control-flow analysis. In P. Hudak and N.D. Jones (eds), Proc. PEPM\u201991, ACM SIGPLAN Not. 26(9), 190\u2013198. ACM Press, Sep. 1991.","DOI":"10.1145\/115866.115884"},{"key":"13_CR71","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-57887-0_98","volume-title":"Proc. Int. Conf. TACS\u201995","author":"Y.M. Tang","year":"1994","unstructured":"Y.M. Tang and P. Jouvelot. Separate abstract interpretation for control-flow analysis. In M. Hagiya and J.C. Mitchell (eds), Proc. Int. Conf. TACS\u201995, LNCS 789, 224\u2013243. Springer, 1994."},{"issue":"1","key":"13_CR72","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0167-6423(99)00012-X","volume":"35","author":"A. Venet","year":"1999","unstructured":"A. Venet. Automatic analysis of pointer aliasing for untyped programs. Sci. Comput. Programming, Special Issue on SAS\u201996, 35(1):223\u2013248, Sep. 1999.","journal-title":"Sci. Comput. Programming, Special Issue on SAS\u201996"},{"key":"13_CR73","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45309-1_22","volume-title":"Proc. 10th ESOP\u2019 2001","author":"Z. Xu","year":"2001","unstructured":"Z. Xu, T. Reps, and B.P. Miller. Typestate checking of machine code. In D. Sands (ed), Proc. 10 th ESOP\u2019 2001, LNCS 2028, 335\u2013351. Springer, 2001."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45937-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T22:16:01Z","timestamp":1707948961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45937-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433699","9783540459378"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/3-540-45937-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"28 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}