article

Properties of data flow frameworks

Authors:

B. G. RyderAuthors Info & Claims

Acta Informatica, Volume 28, Issue 2

Pages 121 - 163

Published: 01 February 1990 Publication History

Abstract

A comprehensive overview of data flow frameworks and their characterizing properties is presented, to clarify property definitions and demonstrate their interrelation. Properties ensuring the existence of a solution are differentiated from those guaranteeing particular convergence behavior for specific solution procedures. Examples illustrate the orthogonality of these precision and convergence properties. In addition, several data flow problems are categorized with respect to these properties.

References

[1]

Abramsky, S., Hankin C. (eds.): Abstract interpretation of declarative languages. Chichester: Ellis Horwood 1987

[2]

Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Reading, MA: Addison-Wesley 1986

[3]

Allen, F.E., Cocke, J.: A program data flow analysis procedure. Commun. ACM19, 137---147 (1977)

[4]

Allen, R., Kennedy, K.: Automatic translation of FORTRAN programs to vector form. ACM Trans. Program. Lang. Syst.9, 491---542 (1987)

Digital Library

[5]

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

[6]

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

[7]

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

[8]

Barth, J.M.: A practical interprocedural data flow analysis algorithm. Commun. ACM21, 724---737 (1978)

[9]

Beatty, J.: Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Dev.18, 20---39 (1974)

Digital Library

[10]

Birkhoff, G.: Lattice theory. American Mathematical Society Colloquium Publications, Washington, DC, 1967

[11]

Burke, M.: An interval analysis approach toward exhaustive and incremental interprocedural data flow analysis. ACM Trans. Program. Lang. Syst.12, 341---395 (1990)

Digital Library

[12]

Burke, M.: Private communication (1989)

[13]

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)

[14]

Burke, M., Ryder, B.G.: A critical analysis of incremental iterative data flow analysis algorithms. IEEE Trans. Software Eng16, 723---728 (1990)

[15]

Cai, J.: Fixed point computation and transformational programming. PhD thesis, Department of Computer Science, Rutgers University, 1987. Rutgers Technical Report DCS-TR-217

[16]

Cai, J., Paige, R.: Program derivation by fixed point computation. Sci. Comput. Program.11, 197---261 (1989)

Digital Library

[17]

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

[18]

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

[19]

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

Digital Library

[20]

Carroll, M.: Data flow update via attribute and dominator updates. PhD thesis, Department of Computer Science, Rutgers University, 1988

[21]

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

[22]

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

Digital Library

[23]

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

[24]

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)

Digital Library

[25]

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

Digital Library

[26]

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

[27]

Cousot, P.: Semantic foundations of program analysis. In: Program Flow Analysis: Theory and Applications, Chap. 10. Englewood Cliffs, NJ: Prentice Hall 1981

[28]

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)

Digital Library

[29]

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)

[30]

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)

Digital Library

[31]

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)

Digital Library

[32]

Cytron, R.: Do-across: Beyond vectorization for multiprocessors. In: Conference Record of the 1986 International Conference on Parallel Processing, pp. 836---844, 1986

[33]

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

[34]

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

Digital Library

[35]

Dijkstra, E.W., Gasteren, A. van: A simple fixpoint argument without the restriction to continuity. Acta Inf.23, 1---8 (1986)

Digital Library

[36]

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

Digital Library

[37]

Ferrante, J., Ottenstein, K., Warren, J.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst.9, 319---349 (1987)

Digital Library

[38]

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

Digital Library

[39]

Graham, S., Wegman, M.: A fast and usually linear algorithm for global data flow analysis. J. ACM23, 172---202 (1976)

[40]

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

[41]

Hecht, M.S.: Flow analysis of computer programs. Amsterdam: Elsevier North-Holland 1977

[42]

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

Digital Library

[43]

Holley, I., Rosen, B.: Qualified data flow problems. IEEE Trans. Software Eng., SE-7, 60---78 (1981)

[44]

Hopcroft, J., Ullman, J.D.: Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley 1979

[45]

Horwitz, S., Demers, A., Teitelbaum, T.: An efficient general iterative algorithm for data-flow analysis. Acta Inf.24, 679---694 (1987)

Digital Library

[46]

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

[47]

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

Digital Library

[48]

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

Digital Library

[49]

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

Digital Library

[50]

Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. J. ACM23, 158---171 (1976)

[51]

Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Inf.7, 305---317 (1977)

Digital Library

[52]

Kennedy, K.: A survey of data flow analysis techniques. In: Program flow analysis theory and applications, Chap. 1 Englewood Cliffs, NJ: Prentice Hall 1981

[53]

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

Digital Library

[54]

Knuth, D.E.: An empirical study of FORTRAN programs. Software Pract. Exper.1, 105---133 (1971)

[55]

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)

[56]

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)

[57]

Manna, Z., Shamir, A.: The theoretical aspects of the optimal fixedpoint. SIAM J. Comput.5, 414---426 (1976)

[58]

Manna, Z., Shamir, A.: The optimal approach to recursive programs. Commun. ACM20, 824---831 (1977)

[59]

Marlowe, T.J.: Incremental iteration and data flow analysis. PhD thesis, Department of Computer Science, Rutgers University, 1989

[60]

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

Digital Library

[61]

McDowell, C.E.: A practical algorithm for static analysis of parallel programs. J. Parallel Distrib. Comput.22, 96---103 (1979)

[62]

Morel, E. Renvoise, C.: Global optimization by suppression of redundancies. Commun. ACM22, 96---103 (1979)

[63]

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

[64]

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

[65]

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

[66]

Padua, D., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM22, 1184---1201 (1986)

[67]

Paull, M.C.: Algorithm design -- A recursion transformation framework. New York, NY: Wiley Interscience 1988

[68]

Rapps S., Weyuker, E.: Selecting software test data using data flow information. IEEE Trans. Software Eng. Se-11, 367---375 (1985)

[69]

Reif, J., Lewis, H.: Efficient symbolic analysis of programs. J. Comput. Syst. Sci.11, 280---313 (1986)

Digital Library

[70]

Reif, J., Tarjan, R.E.: Symbolic program analysis in almost-linear time. SIAM J. Comput.9, 81---93 (1981)

[71]

Reps, T., Teitelbaum, T., Demers, A.: Incremental context-dependent analysis for language-based editors. ACM Trans. Program. Lang. Syst.5, 449---477 (1983)

Digital Library

[72]

Rosen, B.: Monoids for rapid data flow analysis. SIAM J. Comput.9, 159---196 (1980)

[73]

Rosen, B.: A lubricant for data flow analysis. SIAM J. Comput.11, 493---511 (1982)

[74]

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

Digital Library

[75]

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

Digital Library

[76]

Ryder, B.G., Marlowe, T.J., Paull, M.C.: Conditions for incremental iteration: examples and counterexamples. Sci. Comput. Program.11, 1---15 (1988)

Digital Library

[77]

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

[78]

Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Comput. Surv.18, 277---316 (1986)

Digital Library

[79]

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

[80]

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

Digital Library

[81]

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

[82]

Shapiro, R.M., Saint, H.: The representation of algorithms. Technical Report CA-7002-1432. Massachusetts Computer Associates, 1970

[83]

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

[84]

Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst.10, 282---312 (1988)

Digital Library

[85]

Tarjan, R.E.: Testing flow graph reducibility. J. Comput. Syst. Sci.9, 355---365 (1974)

Digital Library

[86]

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

[87]

Tarjan, R.E.: Applications of path compression on balanced trees. J. ACM26, 690---715 (1979)

[88]

Tarjan, R.E.: A unified approach to path problems. J. ACM28, 576---593 (1981)

[89]

Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM28, 594---614 (1981)

[90]

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

[91]

Tenenbaum, A.: Compile time type determination in SETL. In: Proc.ACM 1974 Annual Conference, pp. 95---100, 1974

[92]

Ullman, J.D., Hecht, M.S.: Flow graph reducibility. SIAM J. Comput.1, 188---202 (1972)

[93]

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)

Digital Library

[94]

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

[95]

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

Digital Library

[96]

Weiser, M.: Program slicing. IEEE Trans. Software Eng. SE-10, 352---357 (1984)

[97]

Zadeck, F.K.: Incremental data flow analysis in a structured program editor. PhD thesis, Rice University, 1983

[98]

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)

Digital Library

Cited By

Yan CCheung A(2016)Leveraging lock contention to improve OLTP application performanceProceedings of the VLDB Endowment10.14778/2876473.28764799:5(444-455)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.14778/2876473.2876479
Zanoni MArcelli Fontana FStella F(2015)On applying machine learning techniques for design pattern detectionJournal of Systems and Software10.1016/j.jss.2015.01.037103:C(102-117)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.jss.2015.01.037
Wei SRyder BPezzè MHarman M(2013)Practical blended taint analysis for JavaScriptProceedings of the 2013 International Symposium on Software Testing and Analysis10.1145/2483760.2483788(336-346)Online publication date: 15-Jul-2013
https://dl.acm.org/doi/10.1145/2483760.2483788
Show More Cited By

Index Terms

Properties of data flow frameworks

Recommendations

Preserving Information Flow Properties under Refinement
SP '01: Proceedings of the 2001 IEEE Symposium on Security and Privacy

Abstract: In a stepwise development process, it is essential that system properties that have been already investigated in some phase need not be re-investigated in later phases. In formal developments, this corresponds to the requirement that ...
Model-checking trace-based information flow properties

In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic technique for model-checking trace-based information flow properties for ...
Model-checking trace-based information flow properties

In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic technique for model-checking trace-based information flow properties for ...

Comments

Information & Contributors

Information

Published In

cover image Acta Informatica

Acta Informatica Volume 28, Issue 2

February 1990

90 pages

ISSN:0001-5903

Issue’s Table of Contents

Copyright © Copyright © 1990 Springer-Verlag.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

74
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yan CCheung A(2016)Leveraging lock contention to improve OLTP application performanceProceedings of the VLDB Endowment10.14778/2876473.28764799:5(444-455)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.14778/2876473.2876479
Zanoni MArcelli Fontana FStella F(2015)On applying machine learning techniques for design pattern detectionJournal of Systems and Software10.1016/j.jss.2015.01.037103:C(102-117)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.jss.2015.01.037
Wei SRyder BPezzè MHarman M(2013)Practical blended taint analysis for JavaScriptProceedings of the 2013 International Symposium on Software Testing and Analysis10.1145/2483760.2483788(336-346)Online publication date: 15-Jul-2013
https://dl.acm.org/doi/10.1145/2483760.2483788
Labed Jilani LLouhichi AMraihi OMili A(2012)Invariant relations, invariant functions, and loop functionsInnovations in Systems and Software Engineering10.1007/s11334-012-0189-08:3(195-212)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1007/s11334-012-0189-0
Srivastava VBond MMcKinley KShmatikov VHall MPadua D(2011)A security policy oracleProceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1993498.1993539(343-354)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993498.1993539
Srivastava VBond MMcKinley KShmatikov V(2011)A security policy oracleACM SIGPLAN Notices10.1145/1993316.199353946:6(343-354)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993316.1993539
Edvinsson MLundberg JLöwe WKatevenis MMartonosi MKozyrakis CTemam O(2011)Parallel points-to analysis for multi-core machinesProceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers10.1145/1944862.1944872(45-54)Online publication date: 24-Jan-2011
https://dl.acm.org/doi/10.1145/1944862.1944872
Ramsey NDias JPeyton Jones S(2010)HooplACM SIGPLAN Notices10.1145/2088456.186353945:11(121-134)Online publication date: 30-Sep-2010
https://dl.acm.org/doi/10.1145/2088456.1863539
Ramsey NDias JPeyton Jones SGibbons J(2010)HooplProceedings of the third ACM Haskell symposium on Haskell10.1145/1863523.1863539(121-134)Online publication date: 30-Sep-2010
https://dl.acm.org/doi/10.1145/1863523.1863539
Stone ADiBenedetto SMills Strout MMassey DAmato NFranke HKelly P(2010)Scalable simulation of complex network routing policiesProceedings of the 7th ACM international conference on Computing frontiers10.1145/1787275.1787345(347-356)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1145/1787275.1787345
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents