Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code
B Hardekopf, C Lin - Proceedings of the 28th ACM SIGPLAN …, 2007 - dl.acm.org
Pointer information is a prerequisite for most program analyses, and the quality of this
information can greatly affect their precision and performance. Inclusion-based (ie Andersen …
information can greatly affect their precision and performance. Inclusion-based (ie Andersen …
Semi-sparse flow-sensitive pointer analysis
B Hardekopf, C Lin - ACM SIGPLAN Notices, 2009 - dl.acm.org
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these
analyses depends on the precision of the pointer information they receive. Two major axes …
analyses depends on the precision of the pointer information they receive. Two major axes …
Points-to analysis with efficient strong updates
O Lhoták, KCA Chung - Proceedings of the 38th annual ACM SIGPLAN …, 2011 - dl.acm.org
This paper explores a sweet spot between flow-insensitive and flow-sensitive subset-based
points-to analysis. Flow-insensitive analysis is efficient: it has been applied to million-line …
points-to analysis. Flow-insensitive analysis is efficient: it has been applied to million-line …
A new approach to incremental cycle detection and related problems
We consider the problem of detecting a cycle in a directed graph that grows by arc insertions
and the related problems of maintaining a topological order and the strong components of …
and the related problems of maintaining a topological order and the strong components of …
Incremental cycle detection, topological ordering, and strong component maintenance
We present two online algorithms for maintaining a topological order of a directed n-vertex
acyclic graph as arcs are added, and detecting a cycle when one is created. Our first …
acyclic graph as arcs are added, and detecting a cycle when one is created. Our first …
A dynamic topological sort algorithm for directed acyclic graphs
We consider the problem of maintaining the topological order of a directed acyclic graph
(DAG) in the presence of edge insertions and deletions. We present a new algorithm and …
(DAG) in the presence of edge insertions and deletions. We present a new algorithm and …