Type-based flow analysis: from polymorphic subtyping to CFL-reachability

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 54-65

  Rehof, J ^a   Fahndrich M ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONTEXT FREE LANGUAGES; DATA STRUCTURES; STATISTICAL METHODS;

GLOBAL FLOW SUMMARIZATION; POLYMORPHIC SUBTYPING;

DATA FLOW ANALYSIS;

EID: 0035035698     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Optimal representations of polymorphic types with subtyping
2. Constrained quantification in polymorphic type analysis
3. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
4. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
5. Sound polymorphic type inference for objects
6. Making set-constraint program analyses scale
7. Componential set-based analysis
8. Polymorphic versus monomorphic flow-insensitive points-to analysis for c
9. Polymorphic subtype inference: Closing the theory-practice gap
10. From polymorphic subtyping to CFL reachability: Context-sensitive flow analysis using instantiation constraints
11. Scalable context-sensitive flow analysis using instantiation constraints
12. A usage analysis with bounded usage polymorphism and subtyping
13. Control-flow analysis and type systems
14. Type inference with polymorphic recursion
15. Linear-time subtransitive control flow analysis
16. Demand interprocedural dataflow analysis
17. Type inference in the presence of overloading, subtyping and recursive types
18. Higher-order value flow graphs
19. Interconvertibility of set constraints and context-free language reachability
20. Interconvertibility of set constraints and context-free language reachability
21. Polymorphic type schemes and recursive definitions
22. Lackwit: A program understanding tool based on type inference
23. A type system equivalent to flow analysis
24. Simplifying subtyping constraints
25. Minimal typings in atomic subtyping
26. Program analysis via graph reachability
27. Undecidability of context-sensitive data-dependence analysis
28. Precise interprocedural dataflow analysis via graph reachability
29. Principal type schemes for functional programs with overloading and subtyping
30. Subtyping constrained types
31. Graph-theoretic methods in database theory