Regular model checking made simple and efficient
From MaRDI portal
(Redirected from Regular model checking made simple and efficient)
Recommendations
- Regular model checking revisited
- Regular model checking
- CONCUR 2004 - Concurrency Theory
- Regular model checking: evolution and perspectives
- Regular model checking using widening techniques
- Computer Aided Verification
- Regular model checking with regular relations
- scientific article; zbMATH DE number 2080188
- Practical Efficient Modular Linear-Time Model-Checking
Cited in
(22)- Approximated parameterized verification of infinite-state processes with global conditions
- Iterating transducers
- View abstraction for systems with component identities
- Tree regular model checking: a simulation-based approach
- Parameterised verification for multi-agent systems
- Easy instances for model checking
- Automated formal analysis and verification: an overview
- Model checking parameterized systems
- Efficiency of automata in semi-commutation verification techniques
- Practical Efficient Modular Linear-Time Model-Checking
- Automatic Verification of Directory-Based Consistency Protocols
- Transitive closures of regular relations for verifying infinite-state systems
- Monotonic abstraction in parameterized verification
- Handling Parameterized Systems with Non-atomic Global Conditions
- Monotonic Abstraction in Action
- Tools and Algorithms for the Construction and Analysis of Systems
- Algorithmic improvements in regular model checking.
- Simplifying Alternating Automata for Emptiness Testing
- Computing inductive invariants of regular abstraction frameworks
- Antichain with SAT and tries
- Regular model checking upside-down: an invariant-based approach
- Regular model checking for systems with effectively regular reachability relation
This page was built for publication: Regular model checking made simple and efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484482)
