(Enter summary)
Abstract: Many type based program analyses with subtyping, such as flow analysis, are
based on inequality constraints over a lattice. When inequality constraints are
combined with polymorphism it is often hard to scale the analysis up to large
programs. A major source of inefficiency in conventional implementations stems
from computing substitution instances of constraints. In this paper we extend
the constraint language with constraint abstractions so that instantiation can
be expressed directly in the... (Update)
Active bibliography (related documents): More All
1.7: Constraint Abstractions - Gustavsson, Svenningsson
(Correct)
0.5: Type-Based Flow Analysis: From Polymorphic Subtyping to.. - Rehof, Fähndrich (2001)
(Correct)
0.5: Detecting Format String Vulnerabilities with Type.. - Shankar, Talwar, Foster.. (2001)
(Correct)
Similar documents based on text: More All
0.3: Towards a Scalable Update Avoidance Analysis - Gustavsson, Svenningsson (2000)
(Correct)
0.3: Possibilities and Limitations of Call-by-Need Space Improvement - Gustavsson, Sands (2001)
(Correct)
0.2: Shortcut Fusion for Accumulating Parameters Zip-like Functions - Svenningsson (2002)
(Correct)
BibTeX entry: (Update)
@article{ gustavsson01constraint,
author = "J{\"o}rgen Gustavsson and Josef Svenningsson",
title = "Constraint Abstractions",
journal = "Lecture Notes in Computer Science",
volume = "2053",
pages = "63--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/gustavsson00constraint.html" }
Citations (may not include all citations):
126
Type inference with polymorphic recursion
- Henglein - 1993
75
semantics and abstract interpretation (context) - Cousot, Cousot - 1992
72
Sound polymorphic type inference for objects
- Eifrig, Smith et al. - 1995
68
Subtyping constrained types
- Trifonov, Smith - 1996
67
Componential set-based analysis
- Flanagan, Felleisen - 1997
58
Type inference in the presence of overloading (context) - Kaes - 1992
52
Simplifying subtyping constraints
- Pottier - 1996
47
Program analysis via graph reachability
- Reps - 1997
36
Principal type schemes for functional programs with overload..
- Smith - 1994
34
Uniqueness Typing for Functional Languages with Graph Rewrit..
- Barendsen, Smetsers - 1996
34
Polymorphic subtype inference: Closing the theorypractice ga.. (context) - Fuh, Mishra - 1989
33
Flow Analysis of Typed Higher-Order Programs (context) - Mossin - 1997
33
Polymorphic versus Monomorphic Flow-insensitive Points-to An..
- Foster, Fandrich et al. - 2000
19
Minimal typings in atomic subtyping
- Rehof - 1997
19
Polymorphic recursion and subtype qualifications: Polymorphi.. (context) - Dussart, Henglein et al. - 1995
18
Making set-constraint program analyses scale
- Fandrich, Aiken - 1996
18
Optimal representation of polymorphic types with subtyping
- Aiken, Wimmers et al. - 1997
13
Interconvertibility of a class of set constraints and contex..
- Melski, Reps - 2000
8
Optimizing lazy functional programs using flow inference (context) - Fax'en - 1995
5
A usage analysis with bounded usage polymorphism and subtypi..
- Gustavsson, Svenningsson - 2000
3
An efficient algorithm for a sharing analysis with polymorph.. (context) - Svenningsson - 2000
2
Constrained qualification in polymorphic type analysis (context) - Curtis - 1990
2
Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-..
- Fandrich, Rehof - 2001
Documents on the same site (http://www.cs.chalmers.se/~gustavss/): More
A Type Based Sharing Analysis for Update Avoidance and.. - Gustavsson (1998)
(Correct)
A Usage Analysis With Bounded Usage Polymorphism and.. - Gustavsson, Svenningsson (2000)
(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