(Enter summary)
Abstract: Type-based analysis is an approach to static analysis of programs that has been studied for more than a decade. A type-based analysis assumes that the program type checks, and the analysis takes advantage of that. This paper examines the state of the art of type-based analysis, and it surveys some of the many software tools that use type-based analysis. Most of the surveyed tools use types as discriminators, while most of the theoretical studies use type and effect systems. We conclude that... (Update)
Context of citations to this paper: More
...choices in existing analyses. There are other papers which cover many of the existing reference analyses and compare and contrast them [18, 28]. This paper, by design, will be incomplete in the set of analyses mentioned. Overview. Section 2 presents the dimensions of precision...
Cited by: More
Comparing Bug Finding Tools with Reviews and Tests - Wagner, Jürjens, Koller.. (2005)
(Correct)
Customization of Java Library Classes Using Type.. - De Sutter, Tip, Dolby (2004)
(Correct)
A Practical Type System and Language for Reference Immutability - Birka, Ernst (2004)
(Correct)
Active bibliography (related documents): More All
1.5: From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000)
(Correct)
0.8: Exact Flow Analysis - Mossin (1997)
(Correct)
0.6: A Type System Equivalent to Model Checking - Naik (2003)
(Correct)
Similar documents based on text: More All
0.8: Modelling Interfaces in SDL with Gate Types - Holz
(Correct)
0.6: The Effectiveness of Type-Based Unboxing - Leroy (1997)
(Correct)
0.4: Type-Based Flow Analysis: From Polymorphic Subtyping to.. - Rehof, Fähndrich (2001)
(Correct)
Related documents from co-citation: More All
2: A Fully Abstract Game Semantics for General References (context) - Abramsky, Honda et al. - 1998
2: Precise concrete type inference for objectoriented languages
- Plevyak, Chien - 1994
2: Game-theoretic Analysis of Call-by-value Computation
- Honda, Yoshida - 1997
BibTeX entry: (Update)
Palsberg, J., Type-based analysis and applications, 2001, available at: http://www.cs.purdue.edu/homes/palsberg. http://citeseer.ist.psu.edu/palsberg01typebased.html More
@inproceedings{ palsberg01typebased,
author = "Jens Palsberg",
title = "Type-based analysis and applications",
pages = "20--27",
year = "2001",
url = "citeseer.ist.psu.edu/palsberg01typebased.html" }
Citations (may not include all citations):
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
809
A theory of type polymorphism in programming (context) - Milner - 1978
390
Interprocedural slicing using dependence graphs
- Horwitz, Reps et al. - 1990
306
A syntactic approach to type soundness
- Wright, Felleisen - 1994
227
Kernighan and Dennis M (context) - Brian - 1978
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
190
Optimization of object-oriented programs using static class ..
- Dean, Grove et al. - 1995
188
Region-based memory management
- Tofte, Talpin - 1997
181
Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
176
Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
176
Ellis and Bjarne Stroustrup (context) - Margaret - 1990
151
Objectoriented type inference
- Palsberg, Schwartzbach - 1991
141
Compaq Systems Research Center (context) - Detlefs, Leino et al. - 1998
121
A core calculus of dependency
- Abadi, Banerjee et al. - 1999
107
ObjectOriented Type Systems (context) - Palsberg, Schwartzbach - 1994
99
Polymorphic effect systems (context) - Lucassen, Gi - 1988
93
Talx86: A realistic typed assembly language
- Morrisett, Crary et al. - 1999
90
Type systems
- Cardelli - 1997
89
Systems Programming with Modula (context) - Nelson - 1991
86
Advanced Compiler Design and Implementation (context) - Muchnick - 1997
83
From region inference to von Neumann machines via region rep..
- Birkedal, Tofte et al. - 1996
77
Type-based race detection for Java
- Flanagan, Freund - 2000
75
Practical virtual method call resolution for Java
- Sundaresan, Hendren et al. - 2000
67
ACM Transactions on Programming Languages and Systems (context) - Palsberg, in
64
Fast static analysis of C++ virtual function calls
- Bacon, Sweeney - 1996
62
Scalable propagationbased call graph construction algorithms
- Tip, Palsberg - 2000
57
Modern Compiler Implementation in Java (context) - Appel - 1998
49
Type-based alias analysis
- Diwan, McKinley et al. - 1998
48
Bandera : Extracting nite-state models from Java source code (context) - Corbett, Dwyer et al. - 2000
47
The Java Language Specication (context) - Gosling, Joy et al. - 1996
46
Practical experience with an application extractor for Java
- Tip, La et al. - 1999
40
TAOS: Testing with analysis and oracle support
- Richardson - 1994
38
Secure information ow in multi-threaded imperative language (context) - rey, Dennis - 1998
35
IEEE Transactions on Software Engineering (context) - Weiser - 1984
32
The Modula-3 type system
- Cardelli, Donahue et al. - 1989
25
A new technique for strictness analysis (context) - Wright - 1991
23
Type systems for closure conversions
- Hannan - 1995
23
From polyvariant ow information to intersection and union ty.. (context) - Palsberg, Pavlopoulou - 1998
22
Inference of polymorphic and conditional strictness properti..
- Jensen - 1998
16
Strictness analysis: A new perspective based on type inferen.. (context) - Kuo, Mishra - 1989
15
Type-based useless variable elimination
- Kobayashi - 2000
15
Strongly typed ow-directed representation transformations (context) - Dimock, Muller et al. - 1997
14
The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
13
ective Optimization of Statically Typed Object-Oriented Lang.. (context) - Bacon - 1997
13
Control- ow analysis and type systems (context) - Heintze - 1995
13
Conned types (context) - Bokowski, Vitek - 1999
12
polyvariant and typebased closure analysis (context) - Banerjee, modular - 1997
12
Type-directed ow analysis for typed intermediate languages (context) - Jagannathan, Wright et al. - 1997
11
Annotated Type Systems for Program Analysis (context) - Solberg - 1995
11
Partial redundancy elimination for access path expressions
- Hosking, Nystrom et al. - 2001
10
A calculus with polymorphic and polyvariant ow types (context) - Wells, Dimock et al.
9
Algebraic reconstruction of types and eects (context) - Jouvelot, Gi - 1991
8
Extracting librarybased object-oriented applications (context) - Sweeney, Tip - 2000
7
Separate abstract interpretation for control- ow analysis (context) - Tang, Jouvelot - 1994
6
Java light is typesafe { denitely (context) - Nipkow, von Oheimb - 1998
6
Encapsulating objects with conned types (context) - Grotho, Palsberg et al. - 2001
6
Exact ow analysis (context) - Mossin - 1997
5
Strictness and totality analysis (context) - Solberg, Nielson et al. - 1994
4
Compiling with polymorphic and polyvariant ow types (context) - Turbak, Dimock et al. - 1997
4
The typed lambda-calculus with rst-class processes (context) - Nielson - 1989
4
Field analysis: Getting useful and low-cost interprocedural ..
- Ghemawat, Randall et al. - 2000
4
ect systems with subtyping (context) - Tang, Jouvelot - 1995
4
Type systems and algorithms for useless-variable elimination (context) - Fischbach, Hannan - 2001
4
Strictness and totality analysis with conjunction
- Solberg, Nielson et al. - 1995
3
Using automatic program decomposition techniques in software.. (context) - Gopal, Schach - 1989
3
Minimal thunkication (context) - Amtoft - 1993
3
Uni- ed analysis of array and object references in strongly .. (context) - Fink, Knobe et al. - 2000
3
On strictness and its analysis (context) - Kuo, Mishra - 1987
2
and Jens Palsberg (context) - rb
2
Type-based ow analysis: From polymorphic subtyping to c - re.. (context) - Rehof, ahndrich - 2001
2
Automatic binding time analysis for a typed -calculus (context) - Nielson, Nielson - 1988
2
Typing references by eect inference (context) - Wright - 1992
2
Type-directed continuation allocation
- Shao, Trifonov - 1998
1
A preliminary version was presented at LICS (context) - Talpin, Jouvelot et al. - 1994
1
Flow Analysis of Typed Higher-Order Languages (context) - Mossin - 1997
1
Formalizing resource allocation in a compiler
- Thiemann - 1998
1
Type and eect systems (context) - Nielson, Nielson - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/tba/): More
A Type-Based Locality Analysis for a Functional Distributed.. - Moreira (2000)
(Correct)
Fast and Effective Optimization of Statically Typed.. - Bacon (1997)
(Correct)
Region Analysis and the Polymorphic Lambda Calculus - Banerjee, Heintze, Riecke (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC