Revisiting Underapproximate Reachability for Multipushdown Systems
release_tgrdgpndrvferll4ul7tl2eo64
by
S. Akshay, Paul Gastin, S Krishna, Sparsa Roychowdhury
2020
Abstract
Boolean programs with multiple recursive threads can be captured as pushdown
automata with multiple stacks. This model is Turing complete, and hence, one is
often interested in analyzing a restricted class that still captures useful
behaviors. In this paper, we propose a new class of bounded under
approximations for multi-pushdown systems, which subsumes most existing
classes. We develop an efficient algorithm for solving the under-approximate
reachability problem, which is based on efficient fix-point computations. We
implement it in our tool BHIM and illustrate its applicability by generating a
set of relevant benchmarks and examining its performance. As an additional
takeaway, BHIM solves the binary reachability problem in pushdown automata. To
show the versatility of our approach, we then extend our algorithm to the timed
setting and provide the first implementation that can handle timed
multi-pushdown automata with closed guards.
In text/plain
format
Archived Files and Locations
application/pdf 1.5 MB
file_gx5shsxhy5aljh2sehuua7xmri
|
arxiv.org (repository) web.archive.org (webarchive) |
2002.05950v2
access all versions, variants, and formats of this works (eg, pre-prints)