Rapid parameterized model checking of snoopy cache coherence protocols
From MaRDI portal
Recommendations
- Exact and efficient verification of parameterized cache coherence protocols
- Automatic verification of parameterized cache coherence protocols
- Formal Methods in Computer-Aided Design
- Constraint-based verification of parameterized cache coherence protocols
- ParaVerifier: an automatic framework for proving parameterized cache coherence protocols
Cited in
(10)- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- On one application of computations with oracle
- Constraint-based verification of parameterized cache coherence protocols
- Automatic verification of parameterized cache coherence protocols
- Model checking parameterised multi-token systems via the composition method
- Model checking parameterized systems
- Negotiations and Petri nets
- Verifying Parameterized taDOM+ Lock Managers
- Formal Methods in Computer-Aided Design
- Exact and efficient verification of parameterized cache coherence protocols
This page was built for publication: Rapid parameterized model checking of snoopy cache coherence protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417919)