论文信息 - Approximate Fixed Points in Abstract Interpretation - 字舞流文

Approximate Fixed Points in Abstract Interpretation

Chris Hankin | Sebastian Hunt | C. Hankin | Sebastian Hunt

[1] Samson Abramsky,et al. A relational approach to strictness analysis for higher-order polymorphic functions , 1991, POPL '91.

[2] SEBASTIAN HUNT,et al. Fixed points and frontiers: a new perspective , 1991, Journal of Functional Programming.

[3] Sebastian Hunt,et al. Frontiers and open sets in abstract interpretation , 1989, FPCA.

[4] Chris Hankin,et al. Finding fixed points in finite lattices , 1987, FPCA.

[5] Chris Hankin,et al. Strictness Analysis for Higher-Order Functions , 1986, Sci. Comput. Program..

[6] Neil D. Jones,et al. Data flow analysis of applicative programs using minimal function graphs , 1986, POPL '86.

[7] Simon L. Peyton Jones,et al. Strictness Analysis - A Practical Approach , 1985, FPCA.

[8] Patrick Cousot,et al. Semantic foundations of program analysis , 1981 .

[9] K. Hofmann,et al. A Compendium of Continuous Lattices , 1980 .

[10] P. Cousot. Thesis: These d'Etat es sciences mathematiques: Methodes iteratives de construction et d'approximation de points fixes d'operateurs monotones sur un treillis, analyse semantique de programmes (in French) , 1978 .