Regular model checking
From MaRDI portal
Recommendations
Cited in
(69)- Well-abstracted transition systems: Application to FIFO automata.
- Verification of duration systems using an approximation approach
- Iterating transducers
- View abstraction for systems with component identities
- Regular model checking with regular relations
- Computable fixpoints in well-structured symbolic model checking
- Automata-based symbolic string analysis for vulnerability detection
- A novel approach to verifying context free properties of programs
- Generalized rewrite theories, coherence completion, and symbolic methods
- One-variable context-free hedge automata
- Tree regular model checking: a simulation-based approach
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Learning to verify branching time properties
- Regular model checking using inference of regular languages
- Handling liveness properties in (-)regular model checking
- Modeling and verification of infinite systems with resources
- Automated formal analysis and verification: an overview
- Discrete parameters in Petri nets
- On (omega-)regular model checking
- Reachability games on automatic graphs
- Relational string verification using multi-track automata
- Symbolic model checking in non-Boolean domains
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables
- scientific article; zbMATH DE number 1232242 (Why is no real title available?)
- A decidability result for the model checking of infinite-state systems
- scientific article; zbMATH DE number 2081102 (Why is no real title available?)
- scientific article; zbMATH DE number 1927558 (Why is no real title available?)
- Transitive closures of regular relations for verifying infinite-state systems
- REGULAR STATE MACHINES
- scientific article; zbMATH DE number 1903380 (Why is no real title available?)
- An automata-theoretic approach to the reachability analysis of RPPS systems
- Regular model checking using widening techniques
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- Closure properties of synchronized relations
- The Quantifier Alternation Hierarchy of Synchronous Relations
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Computer Science Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- CONCUR 2004 - Concurrency Theory
- Computer Aided Verification
- Computer Aided Verification
- Systematic Acceleration in Regular Model Checking
- Accelerating Interpolation-Based Model-Checking
- Automated Technology for Verification and Analysis
- Recurrent Reachability Analysis in Regular Model Checking
- Tools and Algorithms for the Construction and Analysis of Systems
- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Algorithmic improvements in regular model checking.
- Model checking, synthesis, and learning
- Regular model checking: evolution and perspectives
- Regular model checking revisited
- Simplifying Alternating Automata for Emptiness Testing
- Decision procedures for sequence theories
- Second-order hyperproperties
- Regular model checking upside-down: an invariant-based approach
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
- On complementation of nondeterministic finite automata without full determinization
- Computing inductive invariants of regular abstraction frameworks
- A new approach for showing termination of parameterized transition systems
- Antichain with SAT and tries
- Deterministic suffix-reading automata
- Regular model checking upside-down: an invariant-based approach
- Deterministic suffix-reading automata
- The beauty of predicate automata
- Regular model checking for systems with effectively regular reachability relation
- Just verification of mutual exclusion algorithms
- Synchronizing relations on words
This page was built for publication: Regular model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754102)
