Type-based analysis and applications

ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

Volumn , Issue , 2001, Pages 20-27

  Palsberg, J ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; PROGRAM DEBUGGING; REVERSE ENGINEERING;

STATIC ANALYSIS; TYPE-BASED ANALYSIS;

SOFTWARE ENGINEERING;

EID: 0034831419     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/379605.379635     Document Type: Conference Paper

References (78)

1. A core calculus of dependency
2. Minimal thunkification
3. Fast static analysis of C++ virtual function calls
4. A modular, polyvariant and type-based closure analysis
5. From region inference to von Neumann machines via region representation inference
6. Confined types
7. Type systems
8. The Modula-3 type system
9. Bandera: Extracting finite-state models from Java source code
10. Optimization of object-oriented programs using static class hierarchy analysis
11. Extended static checking
12. Strongly typed flow-directed representation transformations
13. Type-based alias analysis
14. Unified analysis of array and object references in strongly typed languages
15. Type systems and algorithms for useless-variable elimination
16. Type-based race detection for Java
17. Field analysis: Getting useful and low-cost interprocedural information
18. Using automatic program decomposition techniques in software maintenance tools
19. Encapsulating objects with confined types
20. Type systems for closure conversions
21. Control-flow analysis and type systems
22. Linear-time subtransitive control flow analysis
23. Interprocedural slicing using dependence graphs
24. Partial redundancy elimination for access path expressions
25. Type-directed flow analysis for typed intermediate languages
26. Inference of polymorphic and conditional strictness properties
27. Algebraic reconstruction of types and effects
28. Type-based useless variable elimination
29. On strictness and its analysis
30. Strictness analysis: A new perspective based on type inference
31. Polymorphic effect systems
32. A theory of type polymorphism in programming
33. Talx86: A realistic typed assembly language
34. From system F to typed assembly language
35. Exact flow analysis
36. The typed lambda-calculus with first-class processes
37. Type and effect systems
38. Automatic binding time analysis for a typed λ-calculus
39. light is type-safe - Definitely
40. Trust in the λ-calculus
41. Closure analysis in constraint form
42. From polyvariant flow information to intersection and union types
43. Object-oriented type inference
44. Type-based flow analysis: From polymorphic subtyping to cfl-reachability
45. TAOS: Testing with analysis and oracle support
46. Type-directed continuation allocation
47. Secure information flow in multi-threaded imperative language
48. Strictness and totality analysis
49. Strictness and totality analysis with conjunction
50. Practical virtual method call resolution for Java
51. Extracting library-based object-oriented applications
52. The type and effect discipline
53. Separate abstract interpretation for control-flow analysis
54. Effect systems with subtyping
55. Formalizing resource allocation in a compiler
56. Practical experience with an application extractor for Java
57. Scalable propagation-based call graph construction algorithms
58. Region-based memory management
59. Compiling with polymorphic and polyvariant flow types
60. Program slicing
61. A calculus with polymorphic and polyvariant flow types
62. Typing references by effect inference
63. A syntactic approach to type soundness
64. A new technique for strictness analysis