Global model-checking of infinite-state systems
From MaRDI portal
Recommendations
Cited in
(16)- Uniform strategies, rational relations and jumping automata
- Complexity results on branching-time pushdown model checking
- Infinite state model checking by abstract interpretation and program specialisation
- Global model checking of ordered multi-pushdown systems
- Efficient CTL model-checking for pushdown systems
- Model checking procedural programs
- Winning Regions of Pushdown Parity Games: A Saturation Method
- An automata-theoretic approach to infinite-state systems
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Efficient CTL model-checking for pushdown systems
- Model checking linear properties of prefix-recognizable systems
- Optimal strategies in pushdown reachability games
- Generalization strategies for the verification of infinite state systems
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- Model-checking structured context-free languages
This page was built for publication: Global model-checking of infinite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312916)