Pushdown specifications
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(19)- Model checking properties on reduced trace systems
- Cycle detection in computation tree logic
- Context-free timed formalisms: robust automata and linear temporal logics
- Operator precedence temporal logic and model checking
- Distributed synthesis for regular and contextfree specifications
- Complexity results on branching-time pushdown model checking
- Efficient CTL model-checking for pushdown systems
- Ordered multi-stack visibly pushdown automata
- Enriched μ–Calculus Pushdown Module Checking
- Efficient CTL model-checking for pushdown systems
- Model checking probabilistic systems against pushdown specifications
- scientific article; zbMATH DE number 794257 (Why is no real title available?)
- A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- A first-order complete temporal logic for structured context-free languages
- Reachability analysis of pushdown automata: Application to model-checking
- Interval Temporal Logic for Visibly Pushdown Systems
- Module checking of pushdown multi-agent systems
- Model-checking structured context-free languages
This page was built for publication: Pushdown specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428305)