Advertisement

Expected forms of data flow analyses

  • Flemming Nielson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)

Abstract

A previous paper developed a general denotational framework for specification of data flow analyses and for proofs of correctness (using abstract interpretation). In particular, the method of "inducing" specifies new data flow analyses that as precisely as possible approximate given data flow analyses. However, from a practical point of view the induced versions of the functionals are "too precise" and this motivates a study of "expected forms" (or "normal forms"). This paper suggests such forms and shows the correctness of systematically using them.

Keywords

Tensor Product Natural Transformation Complete Lattice Abstract Interpretation Functional Composition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ArMa 75]
    M.A. Arbib, C.G. Manes: Arrows, Structures and Functors: The Categorical Imperative, Academic Press, 1975.Google Scholar
  2. [CoCo 77]
    P. Cousot, R. Cousot: Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conf. Record of the 4th ACM Symposium on Principles of Programming Languages, 1977.Google Scholar
  3. [CoCo 79]
    P. Cousot, R. Cousot: Systematic design of program analysis framework, in: Conf. Record of the 6th ACM Symposium on Principles of Programming Languages, 1979.Google Scholar
  4. [Don 78]
    V. Donzeau-Gouge: Utilisation de la sémantique dénotationelle pour l'étude d'interprétations non-standard, IRIA report No. 273, France, 1978.Google Scholar
  5. [JoMu 81]
    N.D. Jones, S.S. Mucknick: Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra, in: Program Flow Analysis: Theory and Applications, S.S. Mucknick, N.D. Jones (eds.), Prentice-Hall, 1981.Google Scholar
  6. [Nie 84]
    F. Nielson: Abstract Interpretation Using Domain Theory, Ph.D. thesis, University of Edinburgh, Scotland, 1984.Google Scholar
  7. [Nie 85a]
    F. Nielson: Abstract Interpretation of Denotational Definitions, Proceedings STACS 1986, Springer Lecture Notes in Computer Science.Google Scholar
  8. [Nie 85b]
    F. Nielson: Tensor Products Generalize the Relational Data Flow Analysis Method, 4'th HCSC 1985.Google Scholar
  9. [ShWa 77]
    A. Shamir, W.W. Wadge: Data Types as Objects, in: Proceedings 4th ICALP, Lecture Notes in Computer Science 52, Springer-Verlag, p.p. 465–479.Google Scholar
  10. [SmPl 82]
    M.B. Smyth, G.D. Plotkin: The category-theoretic solution of recursive domain equations, SIAM J. Comput., vol. 11 No. 4 (1982), p.p. 761–783.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Flemming Nielson
    • 1
  1. 1.Institute of Electronic SystemsAalborg University CentreAalborg CDenmark

Personalised recommendations