Automatic verification of parameterized cache coherence protocols
From MaRDI portal
Recommendations
- Constraint-based verification of parameterized cache coherence protocols
- Exact and efficient verification of parameterized cache coherence protocols
- Formal Methods in Computer-Aided Design
- ParaVerifier: an automatic framework for proving parameterized cache coherence protocols
- scientific article; zbMATH DE number 1956578
Cited in
(45)- Approximated parameterized verification of infinite-state processes with global conditions
- Verification of cache coherence protocols by aggregation of distributed transactions
- On one application of computations with oracle
- Constraint-based verification of parameterized cache coherence protocols
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Checking deadlock-freedom of parametric component-based systems
- Computing parameterized invariants of parameterized Petri nets
- Compositional analysis for verification of parameterized systems
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- On the \(\omega\)-language expressive power of extended Petri nets
- Well-structured languages
- Highly dependable concurrent programming using design for verification
- Liveness in broadcast networks
- Model checking parameterized systems
- Using flow specifications of parameterized cache coherence protocols for verifying deadlock freedom
- ParaVerifier: an automatic framework for proving parameterized cache coherence protocols
- scientific article; zbMATH DE number 177247 (Why is no real title available?)
- Verification of a multiprocessor cache protocol using simulation relations and higher-order logic. (Summary)
- Verification of graph grammars using a logical approach
- scientific article; zbMATH DE number 1956578 (Why is no real title available?)
- An automatic proving approach to parameterized verification
- scientific article; zbMATH DE number 2086524 (Why is no real title available?)
- scientific article; zbMATH DE number 1852158 (Why is no real title available?)
- scientific article; zbMATH DE number 1903360 (Why is no real title available?)
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- An assertional language for the verification of systems parametric in several dimensions (preliminary results)
- Automatic generation of verifiable cache coherence simulation models from high-level specifications
- Monotonic abstraction in parameterized verification
- Structural Invariants for the Verification of Systems with Parameterized Architectures
- Computing Parameterized Invariants of Parameterized Petri Nets
- scientific article; zbMATH DE number 7559352 (Why is no real title available?)
- Light-weight SMT-based model checking
- View abstraction -- a tutorial (invited paper)
- Computer Aided Verification
- Handling Parameterized Systems with Non-atomic Global Conditions
- Formal Methods in Computer-Aided Design
- Correct Hardware Design and Verification Methods
- The Verification of the On-Chip COMA Cache Coherence Protocol
- Monotonic Abstraction in Action
- Exact and efficient verification of parameterized cache coherence protocols
- Context-aware counter abstraction
- Monodic fragments of probabilistic first-order temporal logic with bounded semantics
- Action language verifier: An infinite-state model checker for reactive software specifications
- Model checking a cache coherence protocol of a Java DSM implementation
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols
This page was built for publication: Automatic verification of parameterized cache coherence protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754073)
