论文信息 - Expected forms of data flow analyses

Expected forms of data flow analyses

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.

Flemming Nielson | F. Nielson

[1] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[2] M. Arbib,et al. Arrows, Structures, and Functors: The Categorical Imperative , 1975 .

[3] Flemming Nielson,et al. Abstract Interpretation of Denotational Definions (A Survey) , 1986, STACS.

[4] Nielson Flemming,et al. Abstract interpretation using domain theory , 1984 .

[5] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.

[6] William W. Wadge,et al. Data Types as Objects , 1977, ICALP.

[7] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8] Neil D. Jones,et al. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).