A Robust Class of Context-Sensitive Languages

Torre, Salvatore La; Madhusudan, P.; Parlato, Gennaro

doi:10.1109/lics.2007.9

Cited by 109 publications

(175 citation statements)

References 22 publications

Supporting

Mentioning

174

Contrasting

Order By: Relevance

“…Before we introduce our new automata model, we recall multi-stack visibly pushdown automata, as recently introduced by La Torre, Madhusudan, and Parlato [16]. Though this model will be parametrized by Σ, it is not distributed yet.…”

Section: Concurrentmentioning

confidence: 99%

“…Moreover, it was shown that Mvpa can in general not be complemented [5]. We can remedy this situation by restricting our domain to k-phase words [16]. Let k ∈ N. A word w ∈ Σ * is called a k-phase word over Σ if it can be written as…”

Section: Concurrentmentioning

confidence: 99%

“…Merging visibly pushdown automata and asynchronous automata, we obtain concurrent visibly pushdown automata (Cvpa), which are a special case of multistack visibly pushdown automata (Mvpa) [16]. For Mvpa, the reachability problem is again undecidable.…”

Section: Introductionmentioning

confidence: 99%

“…To counteract this drawback, La Torre et al restrict the domain of possible inputs to k-phase words. A k-phase word can be decomposed into k subwords where all processes are able to evolve in a subword but only one process can return from a procedure [16]. Note that this is less restrictive than the notion of bounded context switches that we mentioned above.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Realizability of Concurrent Recursive Programs

Bollig

Grindei

Habermehl

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka's asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka's Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic second-order logic. Building on results from Mazurkiewicz trace theory and work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.

show abstract

Section: Concurrentmentioning

confidence: 99%

Section: Concurrentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Realizability of Concurrent Recursive Programs

Bollig

Grindei

Habermehl

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

show abstract

“…In [TMP07], La Torre et al propose a more general definition of the notion of a context. For that, they define the class of bounded-phase visibly multi-stack pushdown automata (BVMPA) where only those runs are taken into consideration that can be split into a given number of phases, where each phase admits pop transitions of one particular stack only.…”

Section: Introductionmentioning

confidence: 99%

Model-Checking of Ordered Multi-Pushdown Automata

Atig¹

2012

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushdown automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown automata, the set of all predecessors of a regular set of configurations is an effectively constructible regular set. We exploit this result to solve the global model-checking which consists in computing the set of all configurations of an ordered multi-pushdown automaton that satisfy a given w-regular property (expressible in linear-time temporal logics or the linear-time µ-calculus). As an immediate consequence, we obtain an 2ETIME upper bound for the model-checking problem of w-regular properties for ordered multi-pushdown automata (matching its lowerbound).

show abstract

LTL Model-Checking for Communicating Concurrent Programs

Pommellet¹,

Touili²

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present in this paper a new approach to the static analysis of concurrent programs with procedures. To this end, we model multi-threaded programs featuring recursive procedure calls and synchronisation by rendez-vous between parallel threads with communicating pushdown systems (from now on CPDSs).The reachability problem for this particular class of automata is unfortunately undecidable. However, it has been shown that an efficient abstraction of the execution traces language can nonetheless be computed. To this end, an algebraic framework to over-approximate context-free languages has been introduced by Bouajjani et al.In this paper, we combine this framework with an automata-theoretic approach in order to approximate an answer to the model checking problem of the lineartime temporal logic (from now on LTL) on CPDSs. We then present an algorithm that, given a single-indexed or stutter-invariant LTL formula, allows us to prove that no run of a CPDS verifies this formula if the procedure ends.

show abstract

A Robust Class of Context-Sensitive Languages

Abstract: We define a new class of languages defined by multi-

Cited by 109 publications

References 22 publications

Realizability of Concurrent Recursive Programs

Realizability of Concurrent Recursive Programs

Model-Checking of Ordered Multi-Pushdown Automata

LTL Model-Checking for Communicating Concurrent Programs

Contact Info

Product

Resources

About