Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus ORCID: 0000-0003-4783-0389, Pavlogiannis, Andreas and Goyal, Prateesh (2015) Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. ACM SIGPLAN NOTICES, 50 (1). pp. 97-109.

Text algebraRSM.pdf - Author Accepted Manuscript Download (437kB)

Abstract

Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, etc. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect that we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing, but can answer subsequent queries significantly faster as compared to the current best-known solutions for several important problems, such as interprocedural reachability and shortest path. We provide a prototype implementation for interprocedural reachability and intraprocedural shortest path that gives a significant speed-up on several benchmarks.

Item Type:	Article
Uncontrolled Keywords:	Interprocedural analysis, Constant treewidth graphs, Dataflow analysis, Reachability and shortest path
Depositing User:	Symplectic Admin
Date Deposited:	06 Dec 2018 09:10
Last Modified:	26 Feb 2024 03:22
DOI:	10.1145/2775051.2676979
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3029590