Verification of finite state systems by compositional model checking
From MaRDI portal
Recommendations
- A methodology for hardware verification using compositional model checking
- Compositionality in state space verification methods
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Compositional analysis for verification of parameterized systems
- scientific article; zbMATH DE number 1956590
Cited in
(20)- Automated circular assume-guarantee reasoning
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
- Finite verification of the characteristic specification of discrete systems
- Combining search space partition and abstraction for LTL model checking
- Abstractions of data types
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Using heuristic search for finding deadlocks in concurrent systems
- A framework for compositional nonblocking verification of extended finite-state machines
- Model checking parameterized systems
- Liveness by Invisible Invariants
- Specification and encoding of transaction interaction properties
- Compositionality in state space verification methods
- Formal communication elimination and sequentialization equivalence proofs for distributed system models
- Automatic verification of reduction techniques in higher order logic
- Automated circular assume-guarantee reasoning
- Computer Aided Verification
- Algebraic Methodology and Software Technology
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Automatic assume-guarantee reasoning for safety and liveness using passive learning
- Verification of well-formed communicating recursive state machines
This page was built for publication: Verification of finite state systems by compositional model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494394)
