10.1145/3210257
Chatterjee, Krishnendu
Krishnendu
Chatterjee0000-0002-4561-241X
Ibsen-Jensen, Rasmus
Rasmus
Ibsen-Jensen
Goharshady, Amir Kafshdar
Amir Kafshdar
Goharshady0000-0003-1702-6584
Pavlogiannis, Andreas
Andreas
Pavlogiannis
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
Association for Computing Machinery (ACM)
2018
2019-02-14T14:31:52Z
2020-01-21T13:21:08Z
journal_article
/record/6009
/record/6009.json
0164-0925
1510.07565
We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.
Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.