lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Feedback-driven Points-to Analysis
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.ORCID iD: 0000-0001-9775-4594
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.ORCID iD: 0000-0002-7565-3714
2010 (English)Report (Other academic)
Abstract [en]

Points-to analysis is a static program analysis that extracts reference information from agiven input program. Its accuracy is limited due to abstractions that any such analysisneeds to make. Further, the exact analysis results are unknown, i.e., no so-called GoldStandard exists for points-to analysis. This hinders the assessment of new ideas to pointstoanalysis, as results can be compared only relative to results obtained by other inaccurateanalyses.

In this paper, we present feedback-driven points-to analysis. We suggest performing(any classical) points-to analysis with the points-to results at certain programpoints guarded by a-priori upper bounds. Such upper bounds can come from other pointstoanalyses – this is of interest when different approaches are not strictly ordered in termsof accuracy – and from human insight, i.e., manual proofs that certain points-to relationsare infeasible for every program run. This gives us a tool at hand to compute very accuratepoints-to analysis and, ultimately, to manually create a Gold Standard.

Place, publisher, year, edition, pages
2010. , p. 12
National Category
Computer Sciences
Research subject
Computer and Information Sciences Computer Science; Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-9212OAI: oai:DiVA.org:lnu-9212DiVA, id: diva2:359973
Available from: 2010-11-01 Created: 2010-11-01 Last updated: 2018-05-17Bibliographically approved

Open Access in DiVA

fulltext(235 kB)201 downloads
File information
File name FULLTEXT01.pdfFile size 235 kBChecksum SHA-512
0233c0f0b6d42232e72245b0533b9fb7e00bc9290c0261f07cbddfe09afafef579e7eda65a9e63748800a65c72d4e289d4f7363f963a827497018d6aeb08c50c
Type fulltextMimetype application/pdf

Authority records BETA

Gutzmann, TobiasLundberg, JonasLöwe, Welf

Search in DiVA

By author/editor
Gutzmann, TobiasLundberg, JonasLöwe, Welf
By organisation
School of Computer Science, Physics and Mathematics
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 201 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 192 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf