{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:17:59Z","timestamp":1771913879875,"version":"3.50.1"},"reference-count":98,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1007\/bf01237234","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T23:47:12Z","timestamp":1109375232000},"page":"121-163","source":"Crossref","is-referenced-by-count":120,"title":["Properties of data flow frameworks"],"prefix":"10.1007","volume":"28","author":[{"given":"T. J.","family":"Marlowe","sequence":"first","affiliation":[]},{"given":"B. G.","family":"Ryder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Abstract interpretation of declarative languages","year":"1987","unstructured":"Abramsky, S., Hankin C. (eds.): Abstract interpretation of declarative languages. Chichester: Ellis Horwood 1987"},{"key":"CR2","volume-title":"Compilers: principles, techniques, and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Reading, MA: Addison-Wesley 1986"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/360018.360025","volume":"19","author":"F.E. Allen","year":"1977","unstructured":"Allen, F.E., Cocke, J.: A program data flow analysis procedure. Commun. ACM19, 137?147 (1977)","journal-title":"Commun. ACM"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/29873.29875","volume":"9","author":"R. Allen","year":"1987","unstructured":"Allen, R., Kennedy, K.: Automatic translation of FORTRAN programs to vector form. ACM Trans. Program. Lang. Syst.9, 491?542 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR5","unstructured":"Alpern, B., Wegman, M., Zadeck, F.K.: Detecting inequality of values in programs. In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languates, pp. 1?11, 1988"},{"key":"CR6","series-title":"Lect. Notes Comput. Sci.","first-page":"1","volume-title":"Proceedings of 1983 Conference on Logics of Programs","author":"K.R. Apt","year":"1983","unstructured":"Apt, K.R.: A static analysis of CSP programs. Proceedings of 1983 Conference on Logics of Programs. (Lect. Notes Comput. Sci., vol. 164, pp. 1?17) Berlin Heidelberg New York: Springer 1983"},{"key":"CR7","unstructured":"Banning, J.P.: An efficieny way to find the side effects of procedure calls and the aliases of variables. In: Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 29?41, 1979"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1145\/359588.359596","volume":"21","author":"J.M. Barth","year":"1978","unstructured":"Barth, J.M.: A practical interprocedural data flow analysis algorithm. Commun. ACM21, 724?737 (1978)","journal-title":"Commun. ACM"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1147\/rd.181.0020","volume":"18","author":"J. Beatty","year":"1974","unstructured":"Beatty, J.: Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Dev.18, 20?39 (1974)","journal-title":"IBM J. Res. Dev."},{"key":"CR10","volume-title":"Lattice theory","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice theory. American Mathematical Society Colloquium Publications, Washington, DC, 1967"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"M. Burke","year":"1990","unstructured":"Burke, M.: An interval analysis approach toward exhaustive and incremental interprocedural data flow analysis. ACM Trans. Program. Lang. Syst.12, 341?395 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR12","unstructured":"Burke, M.: Private communication (1989)"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Burke, M., Cytron, R.: Interprocedural dependence analysis and parallelization. In: Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 162?175. SIGPLAN Notices21, No. 6 (1986)","DOI":"10.1145\/13310.13328"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/32.56098","volume":"16","author":"M. Burke","year":"1990","unstructured":"Burke, M., Ryder, B.G.: A critical analysis of incremental iterative data flow analysis algorithms. IEEE Trans. Software Eng16, 723?728 (1990)","journal-title":"IEEE Trans. Software Eng"},{"key":"CR15","unstructured":"Cai, J.: Fixed point computation and transformational programming. PhD thesis, Department of Computer Science, Rutgers University, 1987. Rutgers Technical Report DCS-TR-217"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(88)90033-0","volume":"11","author":"J. Cai","year":"1989","unstructured":"Cai, J., Paige, R.: Program derivation by fixed point computation. Sci. Comput. Program.11, 197?261 (1989)","journal-title":"Sci. Comput. Program."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Callahan, D.: The program summary graph and flow sensitive interprocedural data flow analysis. In: Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 47?56, 1988","DOI":"10.1145\/960116.53995"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Callahan, D., Cooper, K., Kennedy, K., Torczon, L.: Interprocedural constant propagation. In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pp. 152?161, 1986","DOI":"10.1145\/12276.13327"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Callahan, D., Subhlok, J.: Static analysis of low-level synchronization. In: Conference Record of the 1988 Workshop on Parallel and Distributed Debugging, pp. 100?111, 1988","DOI":"10.1145\/68210.69225"},{"key":"CR20","unstructured":"Carroll, M.: Data flow update via attribute and dominator updates. PhD thesis, Department of Computer Science, Rutgers University, 1988"},{"key":"CR21","unstructured":"Carroll, M., Ryder, B.: Incremental data flow update via attribute and dominator updates. In: Conference Record of the Fiftheenth Annual ACM Symposium on Principles of Programming Languages, pp. 274?284, 1988"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Chow, A., Rudmik, A.: The design of a data flow analyzer. In: Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 106?113, 1982","DOI":"10.1145\/800230.806985"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Cooper, K.: Analyzing aliases of reference formal parameters. In: Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pp. 281?290, 1984","DOI":"10.1145\/318593.318658"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Cooper, K., Kennedy, K.: Efficient computation of flow insensitive interprocedural summary information. In: Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pp. 247?258. SIGPLAN Notices19, No. 6 (1984)","DOI":"10.1145\/502949.502898"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Cooper, K., Kennedy, K.: Interprocedural side-effect analysis in linear time. In: Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 57?66, 1988","DOI":"10.1145\/53990.53996"},{"key":"CR26","unstructured":"Cooper, K., Kennedy, K.: Fast interprocedural alias analysis. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pp. 49?59, 1989"},{"key":"CR27","volume-title":"Program Flow Analysis: Theory and Applications, Chap. 10","author":"P. Cousot","year":"1981","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Program Flow Analysis: Theory and Applications, Chap. 10. Englewood Cliffs, NJ: Prentice Hall 1981"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth Annual ACM Symposium on Principles of Programming Languages, pp. 238?252. SIGPLAN Notices12, No. 1 (1977)","DOI":"10.1145\/512950.512973"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Automatic synthesis of optimal invariant assertions: Mathematical foundations. In: Proceedings ACM Symposium on Artificial Intelligence and Programming Languages, pp. 1?12. SIGPLAN Notices12, No. 8 (1977)","DOI":"10.1145\/872734.806926"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 269?282. SIGPLAN Notices14, No. 1 (1979)","DOI":"10.1145\/567752.567778"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"Coutant, D.S.: Retargetable high-level alias analysis. In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pp. 110?118. SIGPLAN Notices21, No. 1 (1986)","DOI":"10.1145\/512644.512654"},{"key":"CR32","unstructured":"Cytron, R.: Do-across: Beyond vectorization for multiprocessors. In: Conference Record of the 1986 International Conference on Parallel Processing, pp. 836?844, 1986"},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"Cytron, R., Ferrante, J., Rosen, B., Wegman, M., Zadeck, F.K.: An efficient method of computing static single assignment form. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pp. 25?35, 1989","DOI":"10.1145\/75277.75280"},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"Cytron, R., Lowry, A., Zadeck, F.K.: Code motion of control structures in high-level languages. In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pp. 70?85, 1986","DOI":"10.1145\/512644.512651"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00268074","volume":"23","author":"E.W. Dijkstra","year":"1986","unstructured":"Dijkstra, E.W., Gasteren, A. van: A simple fixpoint argument without the restriction to continuity. Acta Inf.23, 1?8 (1986)","journal-title":"Acta Inf."},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"Emrath, P.A., Padua, D.A.: Automatic detection of nondeterminacy in parallel programs. In: Proceedings of the ACM SIGPLAN\/SIGOPS Workshop on Parallel and Distributed Debugging, pp. 89?99, 1988","DOI":"10.1145\/68210.69224"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K., Warren, J.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst.9, 319?349 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"Fong, A.C.: Generalized common subexpressions in very high level languages. In: Conference Record of the Fourth Annual ACM Symposium on Principles of Programming Languages, pp. 48?57, 1977","DOI":"10.1145\/512950.512956"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"S. Graham","year":"1976","unstructured":"Graham, S., Wegman, M.: A fast and usually linear algorithm for global data flow analysis. J. ACM23, 172?202 (1976)","journal-title":"J. ACM"},{"key":"CR40","doi-asserted-by":"crossref","unstructured":"Harrold, M.J., Soffa, M.L.: Computation of interprocedural definition and use dependencies. In: Proceedings of the IEEE Comp. Soc. 1990 Int. Conference on Computer Languages, pp. 297?306, 1990","DOI":"10.1109\/ICCL.1990.63786"},{"key":"CR41","volume-title":"Flow analysis of computer programs","author":"M.S. Hecht","year":"1977","unstructured":"Hecht, M.S.: Flow analysis of computer programs. Amsterdam: Elsevier North-Holland 1977"},{"key":"CR42","doi-asserted-by":"crossref","unstructured":"Hecht, M.S., Ullman, J.D.: Analysis of a simple algorithm for global flow problems. In: Conference Record of the ACM Symposium on Principles of Programming Languages, pp. 207?217, 1973","DOI":"10.1145\/512927.512946"},{"key":"CR43","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TSE.1981.234509","volume":"7","author":"I. Holley","year":"1981","unstructured":"Holley, I., Rosen, B.: Qualified data flow problems. IEEE Trans. Software Eng., SE-7, 60?78 (1981)","journal-title":"IEEE Trans. Software Eng., SE"},{"key":"CR44","volume-title":"Introduction to automata theory, languages, and computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.D.: Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley 1979"},{"key":"CR45","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00282621","volume":"24","author":"S. Horwitz","year":"1987","unstructured":"Horwitz, S., Demers, A., Teitelbaum, T.: An efficient general iterative algorithm for data-flow analysis. Acta Inf.24, 679?694 (1987)","journal-title":"Acta Inf."},{"key":"CR46","unstructured":"Horwitz, S., Prins, J., Reps, T.: Integrating non-interfering versions of programs. In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pp. 133?145, 1988"},{"key":"CR47","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Prins, J., Reps, T.: On the adequacy of program dependence graphs representing programs. In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pp. 146?157, 1988","DOI":"10.1145\/73560.73573"},{"key":"CR48","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Pfeiffer, P., Reps, T.: Dependence analysis for pointer variables. In: Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pp. 28?40, 1989","DOI":"10.1145\/73141.74821"},{"key":"CR49","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. In: Proceedings of the SIGPLAN'88, Conference on Programming Language Design and Implementation, pp. 35?46, 1988","DOI":"10.1145\/53990.53994"},{"key":"CR50","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. J. ACM23, 158?171 (1976)","journal-title":"J. ACM"},{"key":"CR51","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Inf.7, 305?317 (1977)","journal-title":"Acta Inf."},{"key":"CR52","volume-title":"Program flow analysis theory and applications, Chap. 1","author":"K. Kennedy","year":"1981","unstructured":"Kennedy, K.: A survey of data flow analysis techniques. In: Program flow analysis theory and applications, Chap. 1 Englewood Cliffs, NJ: Prentice Hall 1981"},{"key":"CR53","doi-asserted-by":"crossref","unstructured":"Kildall, G.: A unified approach to global program optimization. In: Conference Record of the ACM Symposium on Principles of Programming Languages, pp. 194?206, 1973","DOI":"10.1145\/512927.512945"},{"key":"CR54","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/spe.4380010203","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: An empirical study of FORTRAN programs. Software Pract. Exper.1, 105?133 (1971)","journal-title":"Software Pract. Exper."},{"key":"CR55","unstructured":"Larus, J., Hilflinger, P.: Detecting conflicts in structure accesses. In: Proceedings of the SIGPLAN'88, Conference on Programming Language Design and Implementation, pp. 21?34, (1986)"},{"key":"CR56","doi-asserted-by":"crossref","unstructured":"Lindstrom, G.: Static evaluation of functional programs. In: Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 196?206. SIGPLAN Notices21, No. 7 (1986)","DOI":"10.1145\/13310.13331"},{"key":"CR57","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/0205033","volume":"5","author":"Z. Manna","year":"1976","unstructured":"Manna, Z., Shamir, A.: The theoretical aspects of the optimal fixedpoint. SIAM J. Comput.5, 414?426 (1976)","journal-title":"SIAM J. Comput."},{"key":"CR58","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/359863.359885","volume":"20","author":"Z. Manna","year":"1977","unstructured":"Manna, Z., Shamir, A.: The optimal approach to recursive programs. Commun. ACM20, 824?831 (1977)","journal-title":"Commun. ACM"},{"key":"CR59","unstructured":"Marlowe, T.J.: Incremental iteration and data flow analysis. PhD thesis, Department of Computer Science, Rutgers University, 1989"},{"key":"CR60","doi-asserted-by":"crossref","unstructured":"Marlowe, T.J., Ryder, B.G.: An efficient hybrid algorithm for incremental data flow analysis. In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pp. 184?196, 1990","DOI":"10.1145\/96709.96728"},{"key":"CR61","first-page":"96","volume":"22","author":"C.E. McDowell","year":"1979","unstructured":"McDowell, C.E.: A practical algorithm for static analysis of parallel programs. J. Parallel Distrib. Comput.22, 96?103 (1979)","journal-title":"J. Parallel Distrib. Comput."},{"key":"CR62","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/359060.359069","volume":"22","author":"E. Morel","year":"1979","unstructured":"Morel, E. Renvoise, C.: Global optimization by suppression of redundancies. Commun. ACM22, 96?103 (1979)","journal-title":"Commun. ACM"},{"key":"CR63","unstructured":"Myers, E.W.: A precise interprocedural data flow algorithm. In: Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, pp. 219?230, 1981"},{"key":"CR64","doi-asserted-by":"crossref","unstructured":"Neirynck, A., Panangaden, P., Demers, A.: Computation of aliases and support sets. In: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pp. 274?283, 1987","DOI":"10.1145\/41625.41650"},{"key":"CR65","doi-asserted-by":"crossref","unstructured":"Ottenstein, K.J., Ottenstein, L.M.: The program dependence graph in a software development environment. In: Proceedings of the ACM SIGSOFT\/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pp. 177?184, 1984","DOI":"10.1145\/800020.808263"},{"key":"CR66","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"22","author":"D. Padua","year":"1986","unstructured":"Padua, D., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM22, 1184?1201 (1986)","journal-title":"Commun. ACM"},{"key":"CR67","volume-title":"Algorithm design ? A recursion transformation framework","author":"M.C. Paull","year":"1988","unstructured":"Paull, M.C.: Algorithm design ? A recursion transformation framework. New York, NY: Wiley Interscience 1988"},{"key":"CR68","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/TSE.1985.232226","volume":"11","author":"S. Rapps","year":"1985","unstructured":"Rapps S., Weyuker, E.: Selecting software test data using data flow information. IEEE Trans. Software Eng. Se-11, 367?375 (1985)","journal-title":"IEEE Trans. Software Eng. Se"},{"key":"CR69","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(86)90031-0","volume":"11","author":"J. Reif","year":"1986","unstructured":"Reif, J., Lewis, H.: Efficient symbolic analysis of programs. J. Comput. Syst. Sci.11, 280?313 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR70","first-page":"81","volume":"9","author":"J. Reif","year":"1981","unstructured":"Reif, J., Tarjan, R.E.: Symbolic program analysis in almost-linear time. SIAM J. Comput.9, 81?93 (1981)","journal-title":"SIAM J. Comput."},{"key":"CR71","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2166.357218","volume":"5","author":"T. Reps","year":"1983","unstructured":"Reps, T., Teitelbaum, T., Demers, A.: Incremental context-dependent analysis for language-based editors. ACM Trans. Program. Lang. Syst.5, 449?477 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR72","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/0209015","volume":"9","author":"B. Rosen","year":"1980","unstructured":"Rosen, B.: Monoids for rapid data flow analysis. SIAM J. Comput.9, 159?196 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR73","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0211039","volume":"11","author":"B. Rosen","year":"1982","unstructured":"Rosen, B.: A lubricant for data flow analysis. SIAM J. Comput.11, 493?511 (1982)","journal-title":"SIAM J. Comput."},{"key":"CR74","doi-asserted-by":"crossref","unstructured":"Rosen, B., Wegman, M., Zadeck, F.K.: Global value numbers and redundant computations. In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pp. 12?27, 1988","DOI":"10.1145\/73560.73562"},{"key":"CR75","doi-asserted-by":"crossref","unstructured":"Ruggieri, C., Murtagh, T.: Lifetime analysis of dynamically allocated objects. In: Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pp. 285?293, 1988","DOI":"10.1145\/73560.73585"},{"key":"CR76","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(88)90061-5","volume":"11","author":"B.G. Ryder","year":"1988","unstructured":"Ryder, B.G., Marlowe, T.J., Paull, M.C.: Conditions for incremental iteration: examples and counterexamples. Sci. Comput. Program.11, 1?15 (1988)","journal-title":"Sci. Comput. Program."},{"key":"CR77","unstructured":"Ryder, B.G., Pande, H.: The interprocedural structure of C programs: An empirical study. Laboratory for Computer Science Research Technical Report LCSR-TR-99, Rutgers University, 1988"},{"key":"CR78","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Comput. Surv.18, 277?316 (1986)","journal-title":"ACM Comput. Surv."},{"key":"CR79","unstructured":"Sagiv, S., Edelstein, O., Francez, N., Rodeh, M.: Resolving circularity in attribute grammars with applications to data flow analysis. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pp. 36?46, 1989"},{"key":"CR80","doi-asserted-by":"crossref","unstructured":"Schonberg, E.: On-the-fly detection of access anomalies. In: Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pp. 285?297, 1989","DOI":"10.1145\/73141.74844"},{"key":"CR81","series-title":"Courant Comput. Sci. Rep.","volume-title":"A design for optimizations of the bitvectoring class","author":"J.T. Schwartz","year":"1979","unstructured":"Schwartz, J.T., Sharir, M.: A design for optimizations of the bitvectoring class. (Courant Comput. Sci. Rep. 17) New York, NY: New York University 1979"},{"key":"CR82","doi-asserted-by":"crossref","unstructured":"Shapiro, R.M., Saint, H.: The representation of algorithms. Technical Report CA-7002-1432. Massachusetts Computer Associates, 1970","DOI":"10.21236\/AD0697026"},{"key":"CR83","volume-title":"Program Flow Analysis: Theory and Applications, Chap. 7","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, Chap. 7. Englewood Cliffs, NJ: Prentice Hall 1981"},{"key":"CR84","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/42190.42277","volume":"10","author":"D. Shasha","year":"1988","unstructured":"Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst.10, 282?312 (1988)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"CR85","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0022-0000(74)80049-8","volume":"9","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Testing flow graph reducibility. J. Comput. Syst. Sci.9, 355?365 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR86","first-page":"71","volume-title":"Algorithms and Complexity-New Directions and Recent Results","author":"R.E. Tarjan","year":"1976","unstructured":"Tarjan, R.E.: Iterative Algorithms for global Flow Analysis. In: Algorithms and Complexity-New Directions and Recent Results, pp. 71?101. New York: Academic Press 1976"},{"key":"CR87","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. J. ACM26, 690?715 (1979)","journal-title":"J. ACM"},{"key":"CR88","first-page":"576","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A unified approach to path problems. J. ACM28, 576?593 (1981)","journal-title":"J. ACM"},{"key":"CR89","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM28, 594?614 (1981)","journal-title":"J. ACM"},{"key":"CR90","unstructured":"Tenenbaum, A.: Determination of types in very high level languages. PhD thesis, Courant Institute of Mathematical Sciences, New York University, 1974. Technical Report Number CCSR #3"},{"key":"CR91","doi-asserted-by":"crossref","unstructured":"Tenenbaum, A.: Compile time type determination in SETL. In: Proc.ACM 1974 Annual Conference, pp. 95?100, 1974","DOI":"10.1145\/800182.810386"},{"key":"CR92","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"J.D. Ullman","year":"1972","unstructured":"Ullman, J.D., Hecht, M.S.: Flow graph reducibility. SIAM J. Comput.1, 188?202 (1972)","journal-title":"SIAM J. Comput."},{"key":"CR93","doi-asserted-by":"crossref","unstructured":"Walz, J., Johnson, G.: Incremental evaluation for a general class of circular attribute grammars. In: Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 209?221. SIGPLAN Notices23 No. 7 (1988)","DOI":"10.1145\/960116.54011"},{"key":"CR94","doi-asserted-by":"crossref","unstructured":"Wegman, M., Zadeck, F.K.: Constant propagation with conditional branches. In: Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pp. 291?299, 1985","DOI":"10.1145\/318593.318659"},{"key":"CR95","doi-asserted-by":"crossref","unstructured":"Weihl, W.: Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables. In: Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pp. 83?94, 1980","DOI":"10.1145\/567446.567455"},{"key":"CR96","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M. Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Software Eng. SE-10, 352?357 (1984)","journal-title":"IEEE Trans. Software Eng. SE"},{"key":"CR97","doi-asserted-by":"crossref","unstructured":"Zadeck, F.K.: Incremental data flow analysis in a structured program editor. PhD thesis, Rice University, 1983","DOI":"10.1145\/502874.502888"},{"key":"CR98","doi-asserted-by":"crossref","unstructured":"Zadeck, F.K.: Incremental data flow analysis in a structured program editor. In: Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 132?143. SIGPLAN Notices19, No. 6 (1984)","DOI":"10.1145\/502949.502888"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01237234.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01237234\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01237234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:04:01Z","timestamp":1586131441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01237234"}},"subtitle":["A unified model"],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":98,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["BF01237234"],"URL":"https:\/\/doi.org\/10.1007\/bf01237234","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}