Parameterized verification of a cache coherence protocol: Safety and liveness
From MaRDI portal
Recommendations
- Abstracting WS1S systems to verify parameterized networks
- Constraint-based verification of parameterized cache coherence protocols
- Formal Methods in Computer-Aided Design
- Exact and efficient verification of parameterized cache coherence protocols
- Automatic verification of parameterized cache coherence protocols
Cited in
(12)- Constraint-based verification of parameterized cache coherence protocols
- Computing parameterized invariants of parameterized Petri nets
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
- Liveness and acceleration in parameterized verification
- Model checking parameterized systems
- Using flow specifications of parameterized cache coherence protocols for verifying deadlock freedom
- Abstracting WS1S systems to verify parameterized networks
- Computing Parameterized Invariants of Parameterized Petri Nets
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Formal Methods in Computer-Aided Design
- Invariants for parameterised Boolean equation systems
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols
This page was built for publication: Parameterized verification of a cache coherence protocol: Safety and liveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737006)