Frontiers and open sets in abstract interpretation
暂无分享,去创建一个
[1] Chris Hankin,et al. Finding fixed points in finite lattices , 1987, FPCA.
[2] Peter Dybjer,et al. Inverse Image Analysis Generalises Strictness Analysis , 1991, Inf. Comput..
[3] Chris Hankin,et al. The theory of strictness analysis for higher order functions , 1985, Programs as Data Objects.
[4] Geoffrey Livingston Burn,et al. Abstract interpretation and the parallel evaluation of functional languages , 1987 .
[5] Michael B. Smyth,et al. Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.
[6] Samson Abramsky,et al. Strictness analysis and polymorphic invariance , 1985, Programs as Data Objects.
[7] Samson Abramsky,et al. Domain Theory in Logical Form , 1991, LICS.
[8] Simon L. Peyton Jones,et al. Strictness Analysis - A Practical Approach , 1985, FPCA.
[9] Christopher D. Clack,et al. Finding fixpoints in abstract interpretation , 1987 .
[10] Alan Mycroft,et al. Abstract interpretation and optimising transformations for applicative programs , 1982 .
[11] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.
[12] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[13] Patrick Cousot,et al. Semantic foundations of program analysis , 1981 .
[14] Patrick Cousot,et al. Static Determination of Dynamic Properties of Recursive Procedures , 1977, Formal Description of Programming Concepts.
[15] Carl A. Gunter,et al. Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[16] Michael B. Smyth,et al. Effectively given Domains , 1977, Theor. Comput. Sci..