SPAS: Scalable path-sensitive pointer analysis on full-sparse SSA

Yulei Sui, Sen Ye, Jingling Xue, Pen Chung Yew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Scopus citations

Abstract

We present a new SPAS (Scalable PAth-Sensitive) framework for resolving points-to sets in C programs that exploits recent advances in pointer analysis. SPAS enables intraprocedural path-sensitivity to be obtained in flow-sensitive and context-sensitive (FSCS) techniques scalably, by using BDDs to manipulate program paths and by performing pointer analysis level-by-level on a full-sparse SSA representation similarly as the state-of-the-art LevPA (the FSCS version of SPAS). Compared with LevPA using all 27 C benchmarks in SPEC CPU2000 and CPU2006, SPAS incurs 18.42% increase in analysis time and 10.97% increase in memory usage on average, while guaranteeing that all points-to sets are obtained with non-decreasing precision.

Original languageEnglish (US)
Title of host publicationProgramming Languages and Systems - 9th Asian Symposium, APLAS 2011, Proceedings
Pages155-171
Number of pages17
DOIs
StatePublished - Dec 26 2011
Event9th Asian Symposium on Programming Languages and Systems, APLAS 2011 - Kenting, Taiwan, Province of China
Duration: Dec 5 2011Dec 7 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7078 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Asian Symposium on Programming Languages and Systems, APLAS 2011
Country/TerritoryTaiwan, Province of China
CityKenting
Period12/5/1112/7/11

Fingerprint

Dive into the research topics of 'SPAS: Scalable path-sensitive pointer analysis on full-sparse SSA'. Together they form a unique fingerprint.

Cite this