scientific article; zbMATH DE number 7577575
From MaRDI portal
Publication:5101344
Matteo Pradella, Michele Chiari, Dino Mandrioli
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2105.10740
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
model checkinglinear temporal logicvisibly pushdown languagesfirst-order completenessoperator-precedence languagesinput-driven language
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite model theory and its applications.
- Model-checking structured context-free languages
- Reasoning about XML with temporal logics and automata
- Generalizing input-driven languages: theoretical and practical benefits
- Operator precedence and the visibly pushdown property
- Model checking LTL with regular valuations for pushdown systems
- Star-freeness, first-order definability and aperiodicity of structured context-free languages
- Operator precedence temporal logic and model checking
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Colored Nested Words
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Predicate Abstraction for Program Verification
- Model Checking Procedural Programs
- Visibly Linear Temporal Logic
- Adding nesting structure to words
- Visibly pushdown languages
- First-Order and Temporal Logics for Nested Words
- First-order properties of trees, star-free expressions, and aperiodicity
- Algebraic properties of operator precedence languages
- Limiting Until in Ordered Tree Query Languages
- Tools and Algorithms for the Construction and Analysis of Systems
- Syntactic Analysis and Operator Precedence
- Parsing Techniques
- Parenthesis Grammars
- Tools and Algorithms for the Construction and Analysis of Systems
- Reachability analysis of pushdown automata: Application to model-checking
- Constrained properties, semilinear systems, and Petri nets
This page was built for publication: