CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis

Tobias Gedell (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; Jörgen Gustavsson ; Josef Svenningsson (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
The Fourth ASIAN Symposium on Programming Languages and Systems Vol. LNCS (2006), 4279, p. 200-216.
[Konferensbidrag, refereegranskat]

There are a number of choices to be made in the design of a type based usage analysis. Some of these are: Should the analysis be monomorphic or have some degree of polymorphism? What aboutsubtyping? How should the analysis deal with user defined algebraic data types? Should it be a whole program analysis? Several researchers have speculated that these features are important but there has been a lack of empirical evidence. In this paper we present a systematic evaluation of each of these features in the context of a full scale implementation of a usage analysis for Haskell. Our measurements show that all features increase the precision. It is, however, not necessary to have them all to obtain an acceptable precision.

Denna post skapades 2007-01-15. Senast ändrad 2013-08-13.
CPL Pubid: 25588


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Scalable Program Analysis and topics in Programming Language Design and Transformation