Properties of Visibly Pushdown Transducers

Filiot, Emmanuel; Raskin, Jean-François; Reynier, Pierre-Alain; Servais, Frédéric; Talbot, Jean-Marc

doi:10.1007/978-3-642-15155-2_32

Cited by 26 publications

(39 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, the complexity of reachability over these models is still open; a simple analysis of [9,19] yields at least double exponential-time complexity for their algorithms. Recently, the authors of [13] observed that replacing the use of Parikh's Theorem [24] in [19] by a recently improved version of [34] immediately yields an NP procedure for this reachability problem (without clocks) for fixed numbers of reversals and counters, yielding only an NEXP procedure in general. Furthermore, the decidability of linear/branching time model checking over these models is also unknown.…”

Section: Introductionmentioning

confidence: 99%

“…We begin by studying pushdown systems enriched with reversal-bounded counters, which can be compared against and incremented by constants given in binary, but without clocks (PCo). This model is more general than the model studied in [13,19], which allows only counters to be compared against 0 and incremented by {−1, 0, 1}, though at the cost of an exponential blow-up (cf. [20]) our model can be translated into their model.…”

Section: Introductionmentioning

confidence: 99%

“…We thank the authors of [7] and [33] for their correspondence, V. D'Silva for recommending [21], J. Leroux and P. Ruemmer for suggesting Z3, A. Sangnier for [13], and anonymous referees for their comments. We thank EPSRC (EP/F036361 and EP/H026878/1) for their support.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Model Checking Recursive Programs with Numeric Data Types

Hague

Lin

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Numeric data types also often arise in real-world programs. We study the extension of PDS with unbounded counters, which naturally model numeric data types. Although this extension is Turingpowerful, reachability is known to be decidable when the number of reversals between incrementing and decrementing modes is bounded. In this paper, we (1) pinpoint the decidability/complexity of reachability and linear/branching time model checking over PDS with reversal-bounded counters (PCo), and (2) experimentally demonstrate the effectiveness of our approach in analysing software. We show reachability over PCo is NP-complete, while LTL is coNEXP-complete (coNP-complete for fixed formulas). In contrast, we prove that EF-logic over PCo is undecidable. Our NP upper bounds are by a direct poly-time reduction to satisfaction over existential Presburger formulas, allowing us to tap into highly optimized solvers like Z3. Although reversal-bounded analysis is incomplete for PDS with unbounded counters in general, our experiments suggest that some intricate bugs (e.g. from Linux device drivers) can be discovered with a small number of reversals. We also pinpoint the decidability/complexity of various extensions of PCo, e.g., with discrete clocks.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model Checking Recursive Programs with Numeric Data Types

Hague

Lin

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The push, pop and local operations are sometimes referred as call, return and internal operations. Visibly pushdown automata are widely used, researched and known to be used in many practical applications, such as XML processing for example [1], [2], [5], [6], [7], [11].…”

Section: Introductionmentioning

confidence: 99%

A New Algorithm for the Determinisation of Visibly Pushdown Automata

Polách

Trávníček

Janoušek

et al. 2015

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-Visibly pushdown automata are pushdown automata whose pushdown operations are determined by the input symbol, where the input alphabet is partitioned into three parts for push, pop and local pushdown operations. It is well known that nondeterministic visibly pushdown automata can be determinised. In this paper a new algorithm for the determinisation of nondeterministic visibly pushdown automata is presented. The algorithm improves the existing methods and can result in significantly smaller deterministic pushdown automata. This is achieved in a way that only necessary and accessible states and pushdown symbols are computed and constructed during the determinisation.Index Terms-Pushdown automata, visibly pushdown automata, deterministic pushdown automata, determinisation of visibly pushdown automata.

show abstract

“…The classical problems on transducers are equivalence, minimization, learning, type checking, and functionality [3,14,15,7]. Except for the latter two questions, one usually studies deterministic transducers because non-determinism quickly leads to fundamental limitations.…”

Section: Introductionmentioning

confidence: 99%

Normalization of Sequential Top-Down Tree-to-Word Transducers

Laurence

Lemay

Niehren

et al. 2011

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. We study normalization of deterministic sequential top-down tree-to-word transducers (stws), that capture the class of deterministic top-down nested-word to word transducers. We identify the subclass of earliest stws (estws) that yield normal forms when minimized. The main result of this paper is an effective normalization procedure for stws. It consists of two stages: we first convert a given stw to an equivalent estw, and then, we minimize the estw.

show abstract

Properties of Visibly Pushdown Transducers

Cited by 26 publications

References 19 publications

Model Checking Recursive Programs with Numeric Data Types

Model Checking Recursive Programs with Numeric Data Types

A New Algorithm for the Determinisation of Visibly Pushdown Automata

Normalization of Sequential Top-Down Tree-to-Word Transducers

Contact Info

Product

Resources

About