Colored Nested Words

2016 ◽  
pp. 143-155 ◽  
Author(s):  
Rajeev Alur ◽  
Dana Fisman
Keyword(s):  
Nested Words

scholarly journals Weighted automata and logics for infinite nested words

2017 ◽  
Vol 253 ◽  
pp. 448-466 ◽  
Author(s):  
Manfred Droste ◽  
Stefan Dück
Keyword(s):  
Weighted Automata ◽  
Nested Words

Mining specifications using nested words

2017 ◽  
Author(s):  
Apurva Narayan ◽  
Nirmal Benann ◽  
Sebastian Fischmeister
Keyword(s):  
Nested Words

Cost Register Automata for Nested Words

2016 ◽  
pp. 587-598 ◽  
Author(s):  
Andreas Krebs ◽  
Nutan Limaye ◽  
Michael Ludwig
Keyword(s):  
Nested Words

scholarly journals Visibly Pushdown Transducers with Well-Nested Outputs

2016 ◽  
Vol 27 (02) ◽  
pp. 235-257 ◽  
Author(s):  
Pierre-Alain Reynier ◽  
Jean-Marc Talbot
Keyword(s):  
Model Transformations ◽  
Type Checking ◽  
Tree Transformations ◽  
Nested Words ◽  
Visibly Pushdown Automata ◽  
Pushdown Automata

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced oto model transformations of nested words, i.e. words with a call/return structure. When outputs are also structured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class of VPTs with well-nested outputs to be decidable in PTIME. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable.

scholarly journals First-Order and Temporal Logics for Nested Words

2008 ◽  
Vol 4 (4) ◽  
Author(s):  
Rajeev Alur ◽  
Marcelo Arenas ◽  
Pablo Barcelo ◽  
Kousha Etessami ◽  
Neil Immerman ◽  
...  
Keyword(s):  
Temporal Logics ◽  
First Order ◽  
Nested Words

scholarly journals Model-Checking Structured Context-Free Languages

2021 ◽  
pp. 387-410
Author(s):  
Michele Chiari ◽  
Dino Mandrioli ◽  
Matteo Pradella
Keyword(s):  
Model Checking ◽  
Use Cases ◽  
Temporal Logics ◽  
Local Properties ◽  
Nested Words ◽  
Checking Procedure ◽  
Definition Of ◽  
And Function ◽  
Context Free

AbstractThe problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL. Recently, the logic OPTL was introduced, based on the class of Operator Precedence Languages (OPL), more powerful than Nested Words. We define the new OPL-based logic POTL, and provide a model checking procedure for it. POTL improves on NWTL by enabling the formulation of requirements involving pre/post-conditions, stack inspection, and others in the presence of exception-like constructs. It improves on OPTL by being FO-complete, and by expressing more easily stack inspection and function-local properties. We developed a model checking tool for POTL, which we experimentally evaluate on some interesting use-cases.

Sign in / Sign up

Export Citation Format

Share Document