Automatic verification of directory-based consistency protocols with graph constraints

DOI10.1142/S0129054111008416MaRDI QIDQ3016215zbMATH OpenFDO

Authors Giorgio Delzanno, Ahmed Rezine, Parosh A. Abdulla

Publication date 14 July 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054111008416

Mathematics Subject Classification ID

Network protocols (68M12) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Automatic Verification of Directory-Based Consistency Protocols
• scientific article; zbMATH DE number 2084712
• Computer Aided Verification
• Formal verification of complex coherence protocols using symbolic state models
• Automatable verification of sequential consistency

Cites work

• Permutation rewriting and algorithmic verification
• Symbolic model checking with rich assertional languages
• Well-structured transition systems everywhere!

Cited in

(2)

• Automatic Verification of Directory-Based Consistency Protocols
• scientific article; zbMATH DE number 2084712 (Why is no real title available?)

This page was built for publication: Automatic verification of directory-based consistency protocols with graph constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016215)