Subcubic algorithms for recursive state machines

Chaudhuri, Swarat

doi:10.1145/1328438.1328460

Cited by 70 publications

(85 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our experiments suggest that this cubic blow-up is impractical without further optimisation, i.e., the naive translation failed to terminate within a couple of hours for most of our examples. Note that the complexity of translating from PDA to CFG is of course very much related to the reachability problem for pushdown systems, for which the optimal complexity is a long-standing open problem (the asymptotically fastest algorithm [11] to date has complexity O(n 3 / log n)).…”

Section: Minimising Cfg Size Via Pushdown Reachability Tablementioning

confidence: 99%

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters

Hague

Lin²

2012

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We study a class of concurrent pushdown automata communicating by both global synchronisations and reversal-bounded counters, providing a natural model for multithreaded programs with procedure calls and numeric data types. We show that the synchronisation-bounded reachability problem can be efficiently reduced to the satisfaction of an existential Presburger formula. Hence, the problem is NP-complete and can be tackled with efficient SMT solvers such as Z3. In addition, we present techniques addressing the important problem of minimisation of pushdown automata. We provide a prototypical implementation of our results and perform preliminary experiments on examples derived from real-world problems.

show abstract

Section: Minimising Cfg Size Via Pushdown Reachability Tablementioning

confidence: 99%

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters

Hague

Lin²

2012

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…CFL-reachability [22,38] is an extension of graph reachability that is equivalent to the reachability problem formulated in terms of either recursive state machines [7] or set constraints [14]. Each reachable path in a PAG has a string formed by concatenating in order the labels of edges in the path, where load/store pairs on the same field must be matched (field sensitivity) and entry/exit pairs for the same callsite must be matched (context sensitivity).…”

Section: Points-to Analysis With Cfl-reachabilitymentioning

confidence: 99%

An Incremental Points-to Analysis with CFL-Reachability

Lü

Shang

Xie

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Developing scalable and precise points-to analyses is increasingly important for analysing and optimising object-oriented programs where pointers are used pervasively. An incremental analysis for a program updates the existing analysis information after program changes to avoid reanalysing it from scratch. This can be efficiently deployed in software development environments where code changes are often small and frequent. This paper presents an incremental approach for demand-driven context-sensitive points-to analyses based on ContextFree Language (CFL) reachability. By tracing the CFL-reachable paths traversed in computing points-to sets, we can precisely identify and recompute on demand only the points-to sets affected by the program changes made. Combined with a flexible policy for controlling the granularity of traces, our analysis achieves significant speedups with little space overhead over reanalysis from scratch when evaluated with a null dereferencing client using 14 Java benchmarks.

show abstract

“…We were particularly influenced by Chaudhuri's paper on subcubic algorithms for recursive state machines [5]. His clear and intuitive description of summarization helped us realize that we can use this technique to explore the state space of CFA2.…”

Section: Related Workmentioning

confidence: 99%

“…Then, at a call-node these functions are used to compute the data-flow value of the corresponding return-node directly. This "summary-based" technique has seen widespread use [5,23]. Other pushdown models include Recursive State Machines [2] and Pushdown Systems [3,10].…”

Section: Introductionmentioning

confidence: 99%

CFA2: a Context-Free Approach to Control-Flow Analysis

Vardoulakis¹,

Shivers²

2011

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and return well: they remember only a bounded number of pending calls because they approximate programs with control-flow graphs. Call/return mismatch introduces precisiondegrading spurious control-flow paths and increases the analysis time.We describe CFA2, the first flow analysis with precise call/return matching in the presence of higher-order functions and tail calls. We formulate CFA2 as an abstract interpretation of programs in continuation-passing style and describe a sound and complete summarization algorithm for our abstract semantics. A preliminary evaluation shows that CFA2 gives more accurate data-flow information than 0CFA and 1CFA.

show abstract

Subcubic algorithms for recursive state machines

Cited by 70 publications

References 27 publications

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters

An Incremental Points-to Analysis with CFL-Reachability

CFA2: a Context-Free Approach to Control-Flow Analysis

Contact Info

Product

Resources

About