The tree-width of C

Krause, Philipp Klaus; Larisch, Lukas; Salfelder, Felix

doi:10.1016/j.dam.2019.01.027

Cited by 5 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, programs written in Pascal, C, and Solidity have treewidth at most 3, 6 and 9, respectively. This property has also been confirmed experimentally for programs written in Java [33], C [37] and Ada [12]. The challenge is thus to exploit treewidth for faster interprocedural on-demand analyses.…”

Section: Lemma 1 ([34]mentioning

confidence: 60%

See 1 more Smart Citation

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis

Chatterjee

Goharshady

Ibsen-Jensen

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries. In this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.

show abstract

Section: Lemma 1 ([34]mentioning

confidence: 60%

“…The most important example is that the flow graph for goto-free programs in many classic programming languages have constant treewidth [62]. The low treewidth of flow graphs has also been confirmed experimentally for programs written in Java [33], C [37], Ada [12] and Solidity [15].…”

Section: Treewidth Of Programsmentioning

confidence: 82%

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis

Chatterjee

Goharshady

Ibsen-Jensen

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability

Yang

Wang

2023

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

We study the parameterized complexity of winner determination problems for three prevalent k-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be -hard or -hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters.

show abstract

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth

Chatterjee

Goharshady

Goyal

et al. 2019

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

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.

show abstract

The tree-width of C

Cited by 5 publications

References 19 publications

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis

Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth

Contact Info

Product

Resources

About