Reachability Problem for Weak Multi-Pushdown Automata

Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir

doi:10.1007/978-3-642-32940-1_6

Cited by 5 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To regain decidability at least for reachability, several subclasses of MPDSs were proposed in literature: (1) bounding the number of context-switches [15], or more generally, phases [10], scopes [11], or budgets [3]; (2) imposing a linear ordering on stacks and pop operations being reserved to the first non-empty stack [5]; (3) restricting control states (e.g., weak MPDSs [7]). However, our decidable subclasses of ASM admit none of the above bounded conditions.…”

Section: Related Workmentioning

confidence: 99%

Android Stack Machine

Chen

Song

et al. 2018

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. In this paper, we propose Android Stack Machine (ASM), a formal model to capture key mechanisms of Android multi-tasking such as activities, back stacks, launch modes, as well as task affinities. The model is based on pushdown systems with multiple stacks, and focuses on the evolution of the back stack of the Android system when interacting with activities carrying specific launch modes and task affinities. For formal analysis, we study the reachability problem of ASM. While the general problem is shown to be undecidable, we identify expressive fragments for which various verification techniques for pushdown systems or their extensions are harnessed to show decidability of the problem.

show abstract

Section: Related Workmentioning

confidence: 99%

Android Stack Machine

Chen

Song

et al. 2018

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks

Kochems

Ong

2013

CONCUR 2013 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the common restriction that messages can only be retrieved by a pushdown process when its stack is empty. We use the notion of partially commutative context-free grammars to describe a new class of asynchronously communicating pushdown systems with a mild shape constraint on the stacks for which the program-point coverability problem remains decidable. Stacks that fit the shape constraint may reach arbitrary heights; further a process may execute any communication action (be it process creation, message send or retrieval) whether or not its stack is empty. This class extends previous computational models studied in the context of asynchronous programs, and enables the safety verification of a large class of message passing programs.

show abstract