• Home
  • Search
  • Selecting Context-Sensitivity Modularly for Accelerating Object-Sensitive Pointer Analysis
  • Cite Icon7
  • https://doi.org/10.1109/tse.2022.3162236Copy DOI Icon

Selecting Context-Sensitivity Modularly for Accelerating Object-Sensitive Pointer Analysis

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Object-sensitive pointer analysis (denoted kobj under κ-limiting) for an object-oriented program can be accelerated if context-sensitivity can be selectively applied to only some precision-critical variables/objects in a program. Existing pre-analyses for making such selections, which are performed as whole-program analyses to a program, are developed based on two broad approaches. One approach preserves the precision of object-sensitive pointer analysis but achieves limited speedups by reasoning about all the possible value flows in the program conservatively, while the other approach achieves greater speedups but sacrifices precision (often unduly) by examining only some but not all the value flows in the program heuristically. In this paper, we introduce a new pre-analysis approach, Turner m (where m stands for modularity), that represents a sweet spot between these two existing ones, as it is designed to enable kobj to run significantly faster than the former approach and achieve significantly better precision than the latter approach. Turner m is simple, lightweight yet effective due to two novel aspects in its design. First, we exploit a key observation that some precision-uncritical objects in the program can be approximated based on the object-containment relationship pre-established (from Andersen's analysis). In practice, this approximation introduces only a small degree of imprecision into kobj. Second, leveraging this initial approximation, we apply a novel object reachability analysis to the program by pre-analyzing its methods according to a reverse topological order of its call graph. When pre-analyzing each method, we make use of a simple DFA (Deterministic Finite Automaton) to reason about object reachability intra-procedurally from its entry to its exit along all the possible value flows established by its statements to identify its precision-critical variables/objects. In practice, this new modular object reachability analysis, which runs linearly in terms of the number of statements in the program, introduces again only a small loss of precision into kobj. We have validated Turner m with an open-source implementation in Soot (already publicly available) against the state of the art by using a set of 12 widely used Java benchmarks and applications.

Similar Papers
  • Conference Article
  • Citations3

Multimodal Spectral Metrics with Discrete Finite Automata for Predicting Epileptic Seizures

  • Aug 01, 2010
  • Rory A Lewis +1
  • Book Chapter
  • Citations1

The structure and complexity of minimal NFA's over a unary alphabet

  • Jan 01, 1991
  • Tao Jiang +2
  • PDF
  • Research Article
  • Citations1

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise

  • Mar 20, 2024
  • Logical Methods in Computer Science
  • Lina Ye +7
  • Research Article
  • Citations1

Managing DFA History with Queue for Deflation DFA

  • Jan 07, 2011
  • Journal of Network and Systems Management
  • Yi Tang +3
  • Conference Article
  • Citations7

Determination of Epileptic Seizure Onset from EEG Data Using Spectral Analysis and Discrete Finite Automata

  • Aug 01, 2010
  • Rory A Lewis +2
  • Research Article

An approximation algorithm for state minimization in 2-MDFAs

  • Aug 08, 2006
  • Formal Aspects of Computing
  • K Subramani +1
  • Conference Article
  • Citations7

DFA-Based Regular Expression Matching on Compressed Traffic

  • Jun 01, 2011
  • Yan Sun +1
  • Book Chapter

High Performance Regular Expression Matching on FPGA

  • Jan 01, 2018
  • Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
  • Jiajia Yang +3
  • PDF
  • Research Article
  • Citations3

Finite Automata Implementations Considering CPU Cache

  • Jan 06, 2007
  • Acta Polytechnica
  • J Holub
  • Conference Article
  • Citations1

Scaling Regular Expression Matching Performance in Parallel Systems through Sampling Techniques

  • Dec 01, 2011
  • Domenico Ficara +6
  • Conference Article
  • Citations7

Proving finite state machines correct with an automaton-based method

  • Jan 01, 1991
  • P Camurati +3
  • Research Article
  • Citations1

Deterministic finite automata with recursive calls and DPDAs

  • May 29, 2003
  • Information Processing Letters
  • Jean H Gallier +2
  • Conference Article
  • Citations18

Deterministic Finite Automaton for scalable traffic identification: The power of compressing by range

  • Apr 01, 2012
  • R Antonello +4
  • Research Article
  • Citations4

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

  • Jan 01, 2022
  • Journal of Scientific Research
  • Rashandeep Singh +1
  • Research Article
  • Citations2

Interference automata

  • May 18, 2008
  • Theoretical Computer Science
  • M.V Panduranga Rao
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.