SkipFlow: Improving the Precision of Points-to Analysis using Primitive Values and Predicate Edges

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F26%3A0193310" target="_blank" >RIV/00216305:26230/26:0193310 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14330/25:00144401

Výsledek na webu

<a href="https://dl.acm.org/doi/10.1145/3696443.3708932" target="_blank" >https://dl.acm.org/doi/10.1145/3696443.3708932</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3696443.3708932" target="_blank" >10.1145/3696443.3708932</a>

Jazyk výsledku

angličtina

Název v původním jazyce

SkipFlow: Improving the Precision of Points-to Analysis using Primitive Values and Predicate Edges

Popis výsledku v původním jazyce

A typical points-to analysis such as Andersen's or Steensgaard's may lose precision because it ignores the branching structure of the analyzed program. Moreover, points-to analysis typically focuses on objects only, not considering instructions manipulating primitive values. We argue that such an approach leads to an unnecessary precision loss, for example, when primitive constants true and false flow out of method calls. We propose a novel lightweight points-to analysis called SkipFlow that interprocedurally tracks the flow of both primitives and objects, and explicitly captures the branching structure of the code using predicate edges. At the same time, however, SkipFlow is as lightweight and scalable as possible, unlike a traditional flow-sensitive analysis. We apply SkipFlow to GraalVM Native Image, a closed-world solution to building standalone binaries for Java applications. We evaluate the implementation using a set of microservice applications as well as well-known benchmark suites. We show that SkipFlow reduces the size of the application in terms of reachable methods by 9% on average without significantly increasing the analysis time.

Název v anglickém jazyce

SkipFlow: Improving the Precision of Points-to Analysis using Primitive Values and Predicate Edges

Popis výsledku anglicky

A typical points-to analysis such as Andersen's or Steensgaard's may lose precision because it ignores the branching structure of the analyzed program. Moreover, points-to analysis typically focuses on objects only, not considering instructions manipulating primitive values. We argue that such an approach leads to an unnecessary precision loss, for example, when primitive constants true and false flow out of method calls. We propose a novel lightweight points-to analysis called SkipFlow that interprocedurally tracks the flow of both primitives and objects, and explicitly captures the branching structure of the code using predicate edges. At the same time, however, SkipFlow is as lightweight and scalable as possible, unlike a traditional flow-sensitive analysis. We apply SkipFlow to GraalVM Native Image, a closed-world solution to building standalone binaries for Java applications. We evaluate the implementation using a set of microservice applications as well as well-known benchmark suites. We show that SkipFlow reduces the size of the application in terms of reachable methods by 9% on average without significantly increasing the analysis time.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA23-06506S" target="_blank" >GA23-06506S: Pokročilá analýza a verifikace pro pokročilý software</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 23rd ACM/IEEE International Symposium on Code Generation and Optimization

ISBN

979-8-4007-1275-3

ISSN

—

e-ISSN

—

Počet stran výsledku

15

Strana od-do

347-361

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Las Vegas, Nevada

Datum konání akce

1. 3. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—