On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability

Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are usual formalisms of demand-driven points-to and alias analyses. The best (offline) algorithm runs in O(m+n · α(n)) time, w...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 8; no. POPL; pp. 1239 - 1268
Main Authors:	Krishna, Shankaranarayanan, Lal, Aniket, Pavlogiannis, Andreas, Tuppe, Omkar
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 02.01.2024
Subjects:	Program analysis Software and its engineering Software verification and validation Theory and algorithms for application domains Theory of computation static analysis dynamic algorithms CFL reachability
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!