Improving flow analyses via ΓCFA: abstract garbage collection and counting
暂无分享,去创建一个
[1] Matthew Might,et al. Continuations and transducer composition , 2006, PLDI '06.
[2] Matthew Might,et al. Environment analysis via ΔCFA , 2006, POPL '06.
[3] John Hannan. Type Systems for Closure Conversions , 2007 .
[4] Mitchell Wand,et al. Selective and lightweight closure conversion , 1994, POPL '94.
[5] Olin Shivers,et al. Control-flow analysis of higher-order languages of taming lambda , 1991 .
[6] Suresh Jagannathan,et al. Polymorphic splitting: an effective polyvariant flow analysis , 1998, TOPL.
[7] Paul Hudak. A semantic model of reference counting and its abstraction (detailed summary) , 1986, LFP '86.
[8] Ole Agesen. The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism , 1995, ECOOP.
[9] Mark N. Wegman,et al. Analysis of pointers and structures , 1990, SIGP.
[10] Suresh Jagannathan,et al. Single and loving it: must-alias analysis for higher-order languages , 1998, POPL '98.
[11] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[12] Jr. Guy L. Steele,et al. Rabbit: A Compiler for Scheme , 1978 .