Model-checking and abstraction to the aid of parameterized systems
From MaRDI portal
Recommendations
Cited in
(17)- A generalized semantics of PROMELA for abstract model checking
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Universal invariant checking of parametric systems with quantifier-free SMT reasoning
- Finite reasons for safety. Parameterized verification by finite model finding
- Liveness and acceleration in parameterized verification
- Automatic deductive verification with invisible invariants
- Parameterized Model Checking of Token-Passing Systems
- Model checking parameterized systems
- Parameterized verification with automatically computed inductive assertions
- A unifying model checking approach for safety properties of parameterized systems
- Abstraction-based model checking using modal transition systems
- Reachability as derivability, finite countermodels and verification
- Algebraic Methodology and Software Technology
- Formal Modeling and Analysis of Timed Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Abduction of trap invariants in parameterized systems
- An automatic abstraction technique for verifying featured, parameterised systems
This page was built for publication: Model-checking and abstraction to the aid of parameterized systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414374)
