Faster Algorithms for Weighted Recursive State Machines

  title={Faster Algorithms for Weighted Recursive State Machines},
  author={Krishnendu Chatterjee and Bernhard Kragl and Samarth Mishra and Andreas Pavlogiannis},
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g… 

The Decidability and Complexity of Interleaved Bidirected Dyck Reachability

This work addresses the decidability and complexity of all variants of interleaved bidirected Dyck reachability, showing that full D: D: reachability is undecidable and improving the recent NP-hardness lower-bound.

The decidability and complexity of interleaved bidirected Dyck reachability

This work addresses the decidability and complexity of all variants of interleaved bidirected Dyck reachability, and improves the recent NP-hardness lower-bound, and shows that the problem is equivalent to the non-bidirected case.



Program Analysis Using Weighted Pushdown Systems

Weighted pushdown systems (WPDSs) are a generalization of PDSs that add a general "black-box" abstraction for program data (through weights) and generalize other frameworks for interprocedural analysis, such as the Sharir-Pnueli functional approach.

Analysis of recursive state machines

This study examines the verification of linear time properties of RSMs, and easily derive algorithms for linear time temporal logic model checking with the same complexity in the model.

Subcubic algorithms for recursive state machines

We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time.

Model Checking Procedural Programs

An extension of Linear Temporal Logic is presented allowing propagation of information across the hierarchical structure induced by procedure calls and matching returns and it is shown how model checking can be extended to this class of programs and properties.

Reachability Analysis of Multithreaded Software with Asynchronous Communication

This talk introduces asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory, and provides efficient algorithms for both forward and backward reachability analysis.

Model checking pushdown systems

The thesis examines model-checking problems for pushdown systems, improving previously known algorithms in terms of both asymptotic complexity and practical usability, and investigates several optimizations which served to improve the efficiency of the checker.

Solving Multiple Dataflow Queries Using WPDSs

This paper shows how to optimize multiple queries on the same program (each with a different starting set of states) for better overall running time, and obtains an asymptotic improvement in answering dataflow queries.

Interprocedural Analysis of Concurrent Programs Under a Context Bound

This paper shows that context-bounded analysis is decidable for certain families of infinite-state abstractions, and also provides a new symbolic algorithm for the finite-state case.

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

The theoretical results show that the 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.

Precise interprocedural dataflow analysis via graph reachability

The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The