Parameterized verification of the FLASH cache coherence protocol by compositional model checking
From MaRDI portal
Recommendations
- An automatic proving approach to parameterized verification
- Formal Methods in Computer-Aided Design
- Automatic verification of parameterized cache coherence protocols
- ParaVerifier: an automatic framework for proving parameterized cache coherence protocols
- Formal verification of coherence for a shared memory multiprocessor model
Cited in
(15)- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Chosen-ciphertext security from subset sum
- Verification of AMBA using a combination of model checking and theorem proving
- Model checking parameterized systems
- An abstraction technique for parameterized model checking of leader election protocols: application to FTSP
- scientific article; zbMATH DE number 177247 (Why is no real title available?)
- Projection approaches to process mining using region-based techniques
- An automatic proving approach to parameterized verification
- Formal verification of coherence for a shared memory multiprocessor model
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Verification, Model Checking, and Abstract Interpretation
- Synthesizing history and prophecy variables for symbolic model checking
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols
This page was built for publication: Parameterized verification of the FLASH cache coherence protocol by compositional model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787228)
