Abstract regular model checking
From MaRDI portal
Recommendations
Cited in
(37)- Don't care words with an application to the automata-based approach for real addition
- Checking deadlock-freedom of parametric component-based systems
- Generating models of infinite-state communication protocols using regular inference with abstraction
- View abstraction for systems with component identities
- Regular model checking with regular relations
- On the k-synchronizability of systems
- Computable fixpoints in well-structured symbolic model checking
- Automata-based symbolic string analysis for vulnerability detection
- Tree regular model checking: a simulation-based approach
- Generalised multi-pattern-based verification of programs with linear linked structures
- FMona: A tool for expressing validation techniques over infinite state systems
- Abstract regular tree model checking
- Automated formal analysis and verification: an overview
- Static analysis of communicating processes using symbolic transducers
- Relational string verification using multi-track automata
- Model checking parameterized systems
- Forward bisimulations for nondeterministic symbolic finite automata
- Bottom-Up Shape Analysis
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- An Infinite Automaton Characterization of Double Exponential Time
- Survey on Directed Model Checking
- Automatic Verification of Directory-Based Consistency Protocols
- Verification of graph grammars using a logical approach
- Regular model checking made simple and efficient
- scientific article; zbMATH DE number 1543047 (Why is no real title available?)
- Abstract conjunctive partial deduction using regular types and its application to model checking
- Structural Invariants for the Verification of Systems with Parameterized Architectures
- View abstraction -- a tutorial (invited paper)
- On Verifying Fault Tolerance of Distributed Protocols
- Regular model checking revisited
- 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
- Deterministic suffix-reading automata
- Regular model checking upside-down: an invariant-based approach
- Deterministic suffix-reading automata
- An automatic abstraction technique for verifying featured, parameterised systems
This page was built for publication: Abstract regular model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312914)
