A survey of regular model checking
From MaRDI portal
Recommendations
Cited in
(55)- An experience in proving regular networks of processes by modular model checking
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- On pebble automata for data languages with decidable emptiness problem
- View abstraction for systems with component identities
- Learning residual alternating automata
- Computing parameterized invariants of parameterized Petri nets
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- Regular model checking with regular relations
- Computable fixpoints in well-structured symbolic model checking
- Regular model checking
- Regular model checking using inference of regular languages
- Handling liveness properties in (-)regular model checking
- Static analysis of communicating processes using symbolic transducers
- Model checking parameterized systems
- Bottom-Up Shape Analysis
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Learning Meets Verification
- scientific article; zbMATH DE number 1232242 (Why is no real title available?)
- Beyond regular model checking
- Regular model checking made simple and efficient
- Transitive closures of regular relations for verifying infinite-state systems
- REGULAR STATE MACHINES
- Regular tree model checking
- Regular model checking using widening techniques
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Computing Parameterized Invariants of Parameterized Petri Nets
- Closure properties of synchronized relations
- The Quantifier Alternation Hierarchy of Synchronous Relations
- Zeno, Hercules, and the Hydra: safety metric temporal logic is Ackermann-complete
- Nash equilibria in symmetric graph games with partial observation
- Tools and Algorithms for the Construction and Analysis of Systems
- Regular model checking for LTL(MSO)
- Abstract regular model checking
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
- Automated Technology for Verification and Analysis
- Systematic Acceleration in Regular Model Checking
- On Verifying Fault Tolerance of Distributed Protocols
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Calculational design of a regular model checker by abstract interpretation
- Algorithmic improvements in regular model checking.
- Model checking, synthesis, and learning
- Regular model checking: evolution and perspectives
- Regular model checking revisited
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- Abduction of trap invariants in parameterized systems
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
- Computing inductive invariants of regular abstraction frameworks
- A new approach for showing termination of parameterized transition systems
- Regular model checking upside-down: an invariant-based approach
- Regular model checking for systems with effectively regular reachability relation
- On notions of regularity for data languages
- Permutation rewriting and algorithmic verification
- Synchronizing relations on words
- CSL model checking algorithms for QBDs
This page was built for publication: A survey of regular model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311492)
