The following pages link to (Q2754102):
Displaying 38 items.
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates (Q680540) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Verification of duration systems using an approximation approach (Q1429422) (← links)
- Iterating transducers (Q1858440) (← links)
- View abstraction for systems with component identities (Q2024368) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Automata-based symbolic string analysis for vulnerability detection (Q2248096) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Discrete Parameters in Petri Nets (Q2941148) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- Relational String Verification Using Multi-track Automata (Q3073648) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
- Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables (Q3637253) (← links)
- (Q4484482) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- Regular Model Checking using Widening Techniques (Q4921501) (← links)
- Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol (Q4921502) (← links)
- Closure properties of synchronized relations (Q5090470) (← links)
- The Quantifier Alternation Hierarchy of Synchronous Relations (Q5092389) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Accelerating Interpolation-Based Model-Checking (Q5458343) (← links)
- Model checking, synthesis, and learning (Q6041187) (← links)
- Regular model checking: evolution and perspectives (Q6045027) (← links)
- Regular model checking revisited (Q6045028) (← links)
- Simplifying Alternating Automata for Emptiness Testing (Q6488157) (← links)
- Decision procedures for sequence theories (Q6535526) (← links)
- Second-order hyperproperties (Q6535541) (← links)
