Skip to main navigation Skip to search Skip to main content

Layered region based flow-sensitive demand-driven alias analysis

  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The pointer alias is indispensable for program analysis. Comparing to point-to set, it's more efficient to formulate the alias as the context free language (CFL) reachability problem. However, the precision is limited to flow-insensitivity. To solve this problem, we propose a flow sensitive, demand-driven analysis algorithm for answering may-alias queries. First the partial single static assignment is used to discriminate the address-taken pointers. Then the order of control flow is encoded in the level linearization code to ease comparison. Finally, the query of alias in demand driven is converted into the search of CFL reachability with feasible flows. The experiments demonstrate the effectiveness of the proposed approach.

Original languageEnglish
Title of host publicationApplied Decisions in Area of Mechanical Engineering and Industrial Manufacturing
PublisherTrans Tech Publications Ltd
Pages917-920
Number of pages4
ISBN (Print)9783038351559
DOIs
StatePublished - 2014
Externally publishedYes
Event3rd International Conference on Mechanical, Control, and Electronic Information, ICMCEI 2014 - , Taiwan, Province of China
Duration: 27 Jun 201429 Jun 2014

Publication series

NameApplied Mechanics and Materials
Volume577
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

Conference3rd International Conference on Mechanical, Control, and Electronic Information, ICMCEI 2014
Country/TerritoryTaiwan, Province of China
Period27/06/1429/06/14

Keywords

  • Alias analysis
  • Dyck-CFL-reachability
  • Flow sensitive analysis
  • Graph reachability

Fingerprint

Dive into the research topics of 'Layered region based flow-sensitive demand-driven alias analysis'. Together they form a unique fingerprint.

Cite this