Exact and efficient verification of parameterized cache coherence protocols

DOI10.1007/B93958MaRDI QIDQ5897071zbMATH OpenOpenAlexFDO

Authors Vineet Kahlon, E. Allen Emerson

Publication date 5 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b93958

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1956578
• scientific article; zbMATH DE number 1670768
• 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

(24)

• Parameterized verification under TSO with data types
• Parameterized model checking of rendezvous systems
• scientific article; zbMATH DE number 1444330 (Why is no real title available?)
• Verifying Parameterized taDOM+ Lock Managers
• Model checking parameterized systems
• scientific article; zbMATH DE number 1956578 (Why is no real title available?)
• Formal Methods in Computer-Aided Design
• scientific article; zbMATH DE number 1670768 (Why is no real title available?)
• ParaVerifier: an automatic framework for proving parameterized cache coherence protocols
• Using flow specifications of parameterized cache coherence protocols for verifying deadlock freedom
• Constraint-based verification of parameterized cache coherence protocols
• scientific article; zbMATH DE number 2086524 (Why is no real title available?)
• scientific article; zbMATH DE number 1903360 (Why is no real title available?)
• An invariant-based approach to the verification of asynchronous parameterized networks
• Correct Hardware Design and Verification Methods
• Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
• Specification and verification of concurrent programs through refinements
• Deriving efficient cache coherence protocols through refinement
• Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols
• Parameterized model checking of networks of timed automata with Boolean guards
• Multi-parameterised compositional verification of safety properties
• Verification, Model Checking, and Abstract Interpretation
• A case study on parametric verification of failure detectors
• Towards general and exact distributed invalidation

Describes a project that uses

Uses Software

• SNOOPY

This page was built for publication: Exact and efficient 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 Q5897071)