[PDF][PDF] The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration
In this article, the Program Committee of the Second Parameterized Algorithms and
Computational Experiments challenge (PACE 2017) reports on the second iteration of the …
Computational Experiments challenge (PACE 2017) reports on the second iteration of the …
Optimal Dyck reachability for data-dependence and alias analysis
K Chatterjee, B Choudhary… - Proceedings of the ACM on …, 2017 - dl.acm.org
A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The
input is a graph where the edges are labeled with different types of opening and closing …
input is a graph where the edges are labeled with different types of opening and closing …
The first parameterized algorithms and computational experiments challenge
Dell, Holger; Husfeldt, Thore; Jansen, Bart MP; Kaski, Petteri; Komusiewicz, Christian;
Rosamond, Frances A. The first Paramet Page 1 This is an electronic reprint of the original …
Rosamond, Frances A. The first Paramet Page 1 This is an electronic reprint of the original …
Efficient approximations for cache-conscious data placement
There is a huge and growing gap between the speed of accesses to data stored in main
memory vs cache. Thus, cache misses account for a significant portion of runtime overhead …
memory vs cache. Thus, cache misses account for a significant portion of runtime overhead …
[PDF][PDF] Optimal and perfectly parallel algorithms for on-demand data-flow analysis
Interprocedural data-flow analyses form an expressive and useful paradigm of numerous
static analysis applications, such as live variables analysis, alias analysis and null pointers …
static analysis applications, such as live variables analysis, alias analysis and null pointers …
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
Interprocedural analysis is at the heart of numerous applications in programming languages,
such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) …
such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) …
JTDec: A tool for tree decompositions in soot
The notion of treewidth of graphs has been exploited for faster algorithms for several
problems arising in verification and program analysis. Moreover, various notions of …
problems arising in verification and program analysis. Moreover, various notions of …
CFL/Dyck Reachability: An Algorithmic Perspective
A Pavlogiannis - ACM SIGLOG News, 2023 - dl.acm.org
CFL/Dyck reachability is a simple graph-theoretic problem: given a CFL/Dyck language L
over an alphabet Σ, a graph G=(V, E) of Σ-labeled edges, and two distinguished nodes s, t∈ …
over an alphabet Σ, a graph G=(V, E) of Σ-labeled edges, and two distinguished nodes s, t∈ …
Learning elimination ordering for tree decomposition problem
We propose a Reinforcement Learning-based approach to approximately solve the Tree
Decomposition problem. Recently, it was shown that learned heuristics could successfully …
Decomposition problem. Recently, it was shown that learned heuristics could successfully …
Improved algorithms for computing the cycle of minimum cost-to-time ratio in directed graphs
We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph
with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial …
with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial …