scholarly journals Region-Based Selective Flow-Sensitive Pointer Analysis

2014 ◽  
pp. 319-336 ◽  
Author(s):  
Sen Ye ◽  
Yulei Sui ◽  
Jingling Xue
Keyword(s):  
Pointer Analysis

Pointer Analysis

2015 ◽  
Author(s):  
Yannis Smaragdakis ◽  
George Balatsouras
Keyword(s):  
Pointer Analysis

Modular interprocedural pointer analysis using access paths

2000 ◽  
Vol 35 (5) ◽  
pp. 57-69 ◽  
Author(s):  
Ben-Chung Cheng ◽  
Wen-Mei W. Hwu
Keyword(s):  
Pointer Analysis

scholarly journals A novel analysis space for pointer analysis and its application for bug finding

2010 ◽  
Vol 75 (11) ◽  
pp. 921-942 ◽  
Author(s):  
Marcio Buss ◽  
Daniel Brand ◽  
Vugranam Sreedhar ◽  
Stephen A. Edwards
Keyword(s):  
Pointer Analysis ◽  
Bug Finding

Using static single assignment form to improve flow-insensitive pointer analysis

1998 ◽  
Vol 33 (5) ◽  
pp. 97-105 ◽  
Author(s):  
Rebecca Hasti ◽  
Susan Horwitz
Keyword(s):  
Pointer Analysis ◽  
Static Single Assignment ◽  
Single Assignment

scholarly journals Applications of Synchronized Pushdown Systems

2020 ◽  
pp. 19-45
Author(s):  
Johannes Späth
Keyword(s):  
Data Flow ◽  
Flow Analysis ◽  
Computational Effort ◽  
Pointer Analysis ◽  
Sensitive Data ◽  
Data Flow Analysis ◽  
Context Sensitive ◽  
Program Slice ◽  
Static Data ◽  
Per Se

AbstractA precise static data-flow analysis transforms the program into a context-sensitive and field-sensitive approximation of the program. It is challenging to design an analysis of this precision efficiently due to the fact that the analysis is undecidable per se. Synchronized pushdown systems (SPDS) present a highly precise approximation of context-sensitive and field-sensitive data-flow analysis. This chapter presents some data-flow analyses that SPDS can be used for. Further on, this chapter summarizes two other contributions of the thesis “Synchronized Pushdown System for Pointer and Data-Flow Analysis” called Boomerang and IDEal. Boomerang is a demand-driven pointer analysis that builds on top of SPDS and minimizes the highly computational effort of a whole-program pointer analysis by restricting the computation to the minimal program slice necessary for an individual query. IDEal is a generic and efficient framework for data-flow analyses, e.g., typestate analysis. IDEal resolves pointer relations automatically and efficiently by the help of Boomerang. This reduces the burden of implementing pointer relations into an analysis. Further on, IDEal performs strong updates, which makes the analysis sound and precise.

Loop-oriented array- and field-sensitive pointer analysis for automatic SIMD vectorization

2016 ◽  
Vol 51 (5) ◽  
pp. 41-51 ◽  
Author(s):  
Yulei Sui ◽  
XIaokang Fan ◽  
Hao Zhou ◽  
Jingling Xue
Keyword(s):  
Pointer Analysis

scholarly journals Value-Flow-Based Demand-Driven Pointer Analysis for C and C++

2020 ◽  
Vol 46 (8) ◽  
pp. 812-835 ◽  
Author(s):  
Yulei Sui ◽  
Jingling Xue
Keyword(s):  
Pointer Analysis ◽  
Value Flow

scholarly journals Efficient field-sensitive pointer analysis of C

2007 ◽  
Vol 30 (1) ◽  
pp. 4 ◽  
Author(s):  
David J. Pearce ◽  
Paul H.J. Kelly ◽  
Chris Hankin
Keyword(s):  
Pointer Analysis
Sign in / Sign up

Export Citation Format

Share Document