Regular model checking: evolution and perspectives
From MaRDI portal
Recommendations
Cites work
- A BDD-based model checker for recursive programs
- Algorithmic improvements in regular model checking.
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Handling Parameterized Systems with Non-atomic Global Conditions
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- Iterating transducers
- Model checking the full modal mu-calculus for infinite sequential processes
- On the regular structure of prefix rewriting
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Reachability analysis of pushdown automata: Application to model-checking
- Regular model checking
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Regular tree model checking
- Symbolic model checking with rich assertional languages
- Symbolic model checking: \(10^{20}\) states and beyond
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Transitive closures of regular relations for verifying infinite-state systems
Cited in
(5)
This page was built for publication: Regular model checking: evolution and perspectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045027)