lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Parallel Reachability and Escape 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)In: 2010 10th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM), IEEE Press, 2010, p. 125-134Conference paper, Published paper (Refereed)
Abstract [en]

Static program analysis usually consists of a number of steps, each producing partial results. For example, the points-to analysis step, calculating object references in a program, usually just provides the input for larger client analyses like reachability and escape analyses. All these analyses are computationally intense and it is therefore vital to create parallel approaches that make use of the processing power that comes from multiple cores in modern desktop computers.

The present paper presents two parallel approachesto increase the efficiency of reachability analysis and escape analysis, based on a parallel points-to analysis. The experiments show that the two parallel approaches achieve a speed-up of 1.5 for reachability analysis and 3.8 for escape analysis on 8 cores for a benchmark suite of Java programs.

 

Place, publisher, year, edition, pages
IEEE Press, 2010. p. 125-134
Keywords [en]
Points-to analysis, Parallel processing, Parallel algorithms, Program analysis, Escape analysis
National Category
Computer Sciences
Research subject
Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-7130DOI: 10.1109/SCAM.2010.10Scopus ID: 2-s2.0-78649398097ISBN: 978-1-4244-8655-7 (print)OAI: oai:DiVA.org:lnu-7130DiVA, id: diva2:343129
Conference
IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM'10)
Available from: 2010-08-12 Created: 2010-08-12 Last updated: 2018-05-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Edvinsson, MarcusLundberg, JonasLöwe, Welf

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 157 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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