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
Fast and Precise Points-to Analysis
Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi. (Software Technology)
Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi. (Software Technology)
Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi. (Software Technology)ORCID iD: 0000-0002-7565-3714
2008 (English)In: Eighth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2008), IEEE Computer Society, Loas Alamitos, CA, USA , 2008, p. 133-142Conference paper, Published paper (Refereed)
Abstract [en]

Many software engineering applications require points-to analysis. Client applications range from optimizing compilers to program development and testing environments to reverse-engineering tools. In this paper, we present a new context-sensitive approach to points-to analysis where calling contexts are distinguished by the points-to sets analyzed for their target expressions. Compared to other well-known context-sensitive techniques, it is faster - twice as fast as the call string approach and by an order of magnitude faster than the object-sensitive technique - and requires less memory. At the same time, it provides higher precision than the call string technique and is similar in precision to the object-sensitive technique. These statements are confirmed by experiments.

Place, publisher, year, edition, pages
IEEE Computer Society, Loas Alamitos, CA, USA , 2008. p. 133-142
Research subject
Computer and Information Sciences Computer Science
Identifiers
URN: urn:nbn:se:vxu:diva-3771DOI: 10.1109/SCAM.2008.26ISBN: 978-0-7695-3353-7 (print)OAI: oai:DiVA.org:vxu-3771DiVA, id: diva2:203728
Available from: 2008-12-19 Created: 2008-12-19 Last updated: 2017-10-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Lundberg, JonasGutzmann, TobiasLöwe, Welf

Search in DiVA

By author/editor
Lundberg, JonasGutzmann, TobiasLöwe, Welf
By organisation
School of Mathematics and Systems Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 121 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