scientific article
From MaRDI portal
Publication:2754102
zbMath0974.68118MaRDI QIDQ2754102
Marcus Nilsson, Ahmed Bouajjani, Tayssir Touili, Bengt Jonsson
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Regular model checking with regular relations, Symbolic Model Checking in Non-Boolean Domains, Learning to verify branching time properties, Discrete Parameters in Petri Nets, Sequential Relational Decomposition, Model checking, synthesis, and learning, Regular model checking: evolution and perspectives, Regular model checking revisited, One-variable context-free hedge automata, Well-abstracted transition systems: Application to FIFO automata., Synchronizing relations on words, A decidability result for the model checking of infinite-state systems, Verification of duration systems using an approximation approach, Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates, Computable fixpoints in well-structured symbolic model checking, Automata-based symbolic string analysis for vulnerability detection, 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, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Tree regular model checking: a simulation-based approach, View abstraction for systems with component identities, A novel approach to verifying context free properties of programs, Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization, Accelerating Interpolation-Based Model-Checking, Generalized rewrite theories, coherence completion, and symbolic methods, Reachability Games on Automatic Graphs, Relational String Verification Using Multi-track Automata, Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables, Closure properties of synchronized relations, The Quantifier Alternation Hierarchy of Synchronous Relations, Expand, enlarge and check: new algorithms for the coverability problem of WSTS, Iterating transducers, Automated formal analysis and verification: an overview
