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

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 about subtyping? How should the analysis deal with user defined algebraic data types? Should it be a whole program an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gedell, Tobias, Gustavsson, Jörgen, Svenningsson, Josef
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 216
container_issue 4279
container_start_page 200
container_title
container_volume LNCS
creator Gedell, Tobias
Gustavsson, Jörgen
Svenningsson, Josef
description 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 about subtyping? 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.
doi_str_mv 10.1007/11924661_13
format Conference Proceeding
fullrecord <record><control><sourceid>swepub_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_20039334</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_research_chalmers_se_7fe1286f_cadd_49b5_9119_926615a6b8c7</sourcerecordid><originalsourceid>FETCH-LOGICAL-p295t-9a084b4af1947b264e3d9c9d4c69386aeec413bdb9cf2ebaa2b0ef7e07c9a86c3</originalsourceid><addsrcrecordid>eNpNkUlLBDEQheMGjsvJP5CLB8HWbJPuHAd3EBRU1FOopKtnWnsjmUH63xtR1LrU4T1eUd8j5ICzE85Yfsq5EUprbrlcIztyqpgqjCxe1smEa84zKZXZ-BNyvkkmTDKRmVzJbbIf4xtLI7nRTE_I633fjG0fhkUd22P6sHLLcai7-TF9XvQN0vvQzwO0dNZBM8Y6UuhKOvN-FWCJ9ByWQB_HASOtO_oUYY6_zj2yVUETcf9n75Kny4vHs-vs9u7q5mx2mw3CTJeZAVYop6DiRuVOaIWyNN6Uyuv0lgZEr7h0pTO-EugAhGNY5chyb6DQXu6Sh-_c-IHDytkh1C2E0fZQ24ARIfiF9QtoWgzRRrR5hVwUurIeytIq46bWJKrWiIR1CtoVPk-ph9-pA0QPTRWg83X8DReJoEmok-_o53qSujkG6_r-PVrO7Fdd9l9d8hOcBINP</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis</title><source>Springer Books</source><creator>Gedell, Tobias ; Gustavsson, Jörgen ; Svenningsson, Josef</creator><contributor>Kobayashi, Naoki</contributor><creatorcontrib>Gedell, Tobias ; Gustavsson, Jörgen ; Svenningsson, Josef ; Kobayashi, Naoki</creatorcontrib><description>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 about subtyping? 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.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540489371</identifier><identifier>ISBN: 9783540489375</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 354048938X</identifier><identifier>EISBN: 9783540489382</identifier><identifier>DOI: 10.1007/11924661_13</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Call Site ; Computer science; control theory; systems ; Context Sensitivity ; Exact sciences and technology ; Program Point ; Program Transformation ; Programming languages ; Software ; Usage Analysis</subject><ispartof>Lecture notes in computer science, 2006, Vol.LNCS (4279), p.200-216</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11924661_13$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11924661_13$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,881,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=20039334$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://research.chalmers.se/publication/25588$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><contributor>Kobayashi, Naoki</contributor><creatorcontrib>Gedell, Tobias</creatorcontrib><creatorcontrib>Gustavsson, Jörgen</creatorcontrib><creatorcontrib>Svenningsson, Josef</creatorcontrib><title>Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis</title><title>Lecture notes in computer science</title><description>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 about subtyping? 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.</description><subject>Applied sciences</subject><subject>Call Site</subject><subject>Computer science; control theory; systems</subject><subject>Context Sensitivity</subject><subject>Exact sciences and technology</subject><subject>Program Point</subject><subject>Program Transformation</subject><subject>Programming languages</subject><subject>Software</subject><subject>Usage Analysis</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540489371</isbn><isbn>9783540489375</isbn><isbn>354048938X</isbn><isbn>9783540489382</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkUlLBDEQheMGjsvJP5CLB8HWbJPuHAd3EBRU1FOopKtnWnsjmUH63xtR1LrU4T1eUd8j5ICzE85Yfsq5EUprbrlcIztyqpgqjCxe1smEa84zKZXZ-BNyvkkmTDKRmVzJbbIf4xtLI7nRTE_I633fjG0fhkUd22P6sHLLcai7-TF9XvQN0vvQzwO0dNZBM8Y6UuhKOvN-FWCJ9ByWQB_HASOtO_oUYY6_zj2yVUETcf9n75Kny4vHs-vs9u7q5mx2mw3CTJeZAVYop6DiRuVOaIWyNN6Uyuv0lgZEr7h0pTO-EugAhGNY5chyb6DQXu6Sh-_c-IHDytkh1C2E0fZQ24ARIfiF9QtoWgzRRrR5hVwUurIeytIq46bWJKrWiIR1CtoVPk-ph9-pA0QPTRWg83X8DReJoEmok-_o53qSujkG6_r-PVrO7Fdd9l9d8hOcBINP</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Gedell, Tobias</creator><creator>Gustavsson, Jörgen</creator><creator>Svenningsson, Josef</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope><scope>ADTPV</scope><scope>BNKNJ</scope><scope>F1S</scope></search><sort><creationdate>2006</creationdate><title>Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis</title><author>Gedell, Tobias ; Gustavsson, Jörgen ; Svenningsson, Josef</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p295t-9a084b4af1947b264e3d9c9d4c69386aeec413bdb9cf2ebaa2b0ef7e07c9a86c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Call Site</topic><topic>Computer science; control theory; systems</topic><topic>Context Sensitivity</topic><topic>Exact sciences and technology</topic><topic>Program Point</topic><topic>Program Transformation</topic><topic>Programming languages</topic><topic>Software</topic><topic>Usage Analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gedell, Tobias</creatorcontrib><creatorcontrib>Gustavsson, Jörgen</creatorcontrib><creatorcontrib>Svenningsson, Josef</creatorcontrib><collection>Pascal-Francis</collection><collection>SwePub</collection><collection>SwePub Conference</collection><collection>SWEPUB Chalmers tekniska högskola</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gedell, Tobias</au><au>Gustavsson, Jörgen</au><au>Svenningsson, Josef</au><au>Kobayashi, Naoki</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis</atitle><btitle>Lecture notes in computer science</btitle><date>2006</date><risdate>2006</risdate><volume>LNCS</volume><issue>4279</issue><spage>200</spage><epage>216</epage><pages>200-216</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540489371</isbn><isbn>9783540489375</isbn><eisbn>354048938X</eisbn><eisbn>9783540489382</eisbn><abstract>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 about subtyping? 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.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11924661_13</doi><tpages>17</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2006, Vol.LNCS (4279), p.200-216
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_20039334
source Springer Books
subjects Applied sciences
Call Site
Computer science
control theory
systems
Context Sensitivity
Exact sciences and technology
Program Point
Program Transformation
Programming languages
Software
Usage Analysis
title Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T20%3A06%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-swepub_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Polymorphism,%20Subtyping,%20Whole%20Program%20Analysis%20and%20Accurate%20Data%20Types%20in%20Usage%20Analysis&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Gedell,%20Tobias&rft.date=2006&rft.volume=LNCS&rft.issue=4279&rft.spage=200&rft.epage=216&rft.pages=200-216&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540489371&rft.isbn_list=9783540489375&rft_id=info:doi/10.1007/11924661_13&rft_dat=%3Cswepub_pasca%3Eoai_research_chalmers_se_7fe1286f_cadd_49b5_9119_926615a6b8c7%3C/swepub_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=354048938X&rft.eisbn_list=9783540489382&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true