Regular model checking: evolution and perspectives
From MaRDI portal
Recommendations
Cites work
- 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 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 1538041 (Why is no real title available?)
- scientific article; zbMATH DE number 1796140 (Why is no real title available?)
- scientific article; zbMATH DE number 1796143 (Why is no real title available?)
- scientific article; zbMATH DE number 1903380 (Why is no real title available?)
- 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 Without Transducers (On Efficient Verification of Parameterized Systems)
- 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
Cited in
(5)- scientific article; zbMATH DE number 1927558 (Why is no real title available?)
- scientific article; zbMATH DE number 2087513 (Why is no real title available?)
- Parameterized verification under TSO with data types
- Computing inductive invariants of regular abstraction frameworks
- Regular model checking for systems with effectively regular reachability relation
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)