First-Order and Temporal Logics for Nested Words
From MaRDI portal
Recommendations
Cited in
(28)- Evolving schemas for streaming XML
- Visibly linear temporal logic
- Model-checking structured context-free languages
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Model checking dynamic memory allocation in operating systems
- scientific article; zbMATH DE number 7577575 (Why is no real title available?)
- Verifying quantitative temporal properties of procedural programs
- Realizability of Concurrent Recursive Programs
- Temporal reasoning for procedural programs
- Verification of programs with exceptions through operator precedence automata
- Model checking procedural programs
- Toward a theory of input-driven locally parsable languages
- Operator precedence temporal logic and model checking
- A Branching Time Variant of CaRet
- Hybrid and first-order complete extensions of CaRet
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Regular languages of nested words: fixed points, automata, and synchronization
- The complexity of model checking multi-stack systems
- Operator precedence languages: their automata-theoretic and logic characterization
- Temporal logics with language parameters
- State Complexity of Nested Word Automata
- CVPP: a tool set for compositional verification of control-flow safety properties
- ProMoVer: modular verification of temporal safety properties
- Visibly pushdown modular games
- scientific article; zbMATH DE number 7447741 (Why is no real title available?)
- Visibly pushdown transducers
- Generalizing input-driven languages: theoretical and practical benefits
- First-order logic definability of free languages
This page was built for publication: First-Order and Temporal Logics for Nested Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623007)
