scientific article; zbMATH DE number 1232241
From MaRDI portal
Publication:4223067
Recommendations
Cited in
(40)- Verification in loosely synchronous queue-connected discrete timed automata.
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Pushdown reachability with constant treewidth
- Iterating transducers
- Eliminating the storage tape in reachability constructions.
- Model checking LTL with regular valuations for pushdown systems
- Verifying parallel programs with dynamic communication structures
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- CTL* model checking for data-aware dynamic systems with arithmetic
- Faster pushdown reachability analysis with applications in network verification
- Complexity results on branching-time pushdown model checking
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Normalization of linear Horn clauses
- Efficient CTL model-checking for pushdown systems
- SAT-Based Model Checking
- Model checking procedural programs
- Winning Regions of Pushdown Parity Games: A Saturation Method
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- Verifying Parallel Programs with Dynamic Communication Structures
- scientific article; zbMATH DE number 2080197 (Why is no real title available?)
- A counting logic for structure transition systems
- A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES
- Optimal strategies in pushdown reachability games
- Domains for Higher-Order Games
- Pushdown systems with stack manipulation
- An automata-based approach for \(\text{CTL}^{*}\) with constraints
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Program Analysis Using Weighted Pushdown Systems
- Detecting useless transitions in pushdown automata
- Verification, Model Checking, and Abstract Interpretation
- An extension of pushdown system and its model checking method.
- The regular viewpoint on PA-processes
- Reachability analysis of pushdown automata: Application to model-checking
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
- Reachability problems on reliable and lossy queue automata
- Model-checking structured context-free languages
- An efficient automata approach to some problems on context-free grammars.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223067)
