Algorithmic improvements in regular model checking.
From MaRDI portal
Recommendations
Cited in
(20)- Don't care words with an application to the automata-based approach for real addition
- Tree regular model checking: a simulation-based approach
- Learning to verify branching time properties
- Regular model checking
- Regular model checking using inference of regular languages
- Algorithmic algebraic model checking. III: Approximate methods
- Efficiency of automata in semi-commutation verification techniques
- Learning Meets Verification
- Extrapolating tree transformations
- Regular tree model checking
- Regular model checking using widening techniques
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Tools and Algorithms for the Construction and Analysis of Systems
- A survey of regular model checking
- Regular model checking for LTL(MSO)
- Systematic Acceleration in Regular Model Checking
- On Verifying Fault Tolerance of Distributed Protocols
- Model checking, synthesis, and learning
- Regular model checking: evolution and perspectives
- Regular model checking revisited
This page was built for publication: Algorithmic improvements in regular model checking.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900681)