|
18
|
Type-Based Useless Variable Elimination
– Naoki Kobayashi
- 1999
|
|
2
|
The TkInter homepage. http://www.python.org/topics/tkinter
– Ferruccio Damiani, Paola Giannini
- 2001
|
|
10
|
Control-Flow Analysis of Functional Programs
– Jan Midtgaard
- 2007
|
|
|
Dependence Analysis Through Type Inference
– O. Hafizogullari, C. Kreitz
- 1999
|
|
5
|
Detecting and removing dead code using rank 2 intersection
– Ferrrucio Damiani, Frédéric Prost
- 1998
|
|
|
Irrelevance, Polymorphism, and Erasure in Type Theory
– Richard Nathan Mishra-Linger
- 2008
|
|
27
|
Type-Based Analysis and Applications
– Jens Palsberg
- 2001
|
|
|
A formalization of Static Analyses in System F
– Frédéric Prost
- 1999
|
|
5
|
Solving Regular Tree Grammar Based Constraints
– Yanhong A. Liu, Ning Li, Scott D. Stoller
- 2000
|
|
3
|
Subtransitive CFA using Types
– Bratin Saha, Bratin Saha, Nevin Heintze, Nevin Heintze, Dino Oliva, Dino Oliva
- 1998
|
|
|
Flow Analysis, Linearity, and PTIME
– David Van Horn, Harry G. Mairson
|
|
3
|
Selectors make set-based analysis too hard. Higher Order and Symbolic Computation
– Robert Bruce Findler, Paul Steckler
- 2005
|
|
15
|
A New Approach to Control Flow Analysis
– Pasquale Malacaria, Chris Hankin
- 1998
|
|
22
|
Interconvertibility of a Class of Set Constraints and Context-Free-Language Reachability
– David Melski, Thomas Reps
- 1998
|
|
20
|
Efficient field-sensitive pointer analysis for C
– David J. Pearce, Paul H. J. Kelly, Chris Hankin
|
|
26
|
Interconvertibility of Set Constraints and Context-Free Language Reachability
– David Melski, Thomas Reps
- 1996
|
|
8
|
Boolean constraints for binding-time analysis
– Kevin Glynn, Peter J. Stuckey, Martin Sulzmann
- 2001
|
|
16
|
Type-Directed Flow Analysis for Typed Intermediate Languages
– Suresh Jagannathan, Stephen Weeks, Andrew Wright
- 1997
|
|
10
|
Equality-based flow analysis versus recursive types
– Jens Palsberg
- 1998
|
