Efficiently and completely verifying synchronized consistency models

DOI10.1007/978-3-319-11936-6_20zbMATH Open1448.68038OpenAlexW2264377422MaRDI QIDQ3457803FDOQ3457803

Authors: Yi Lv, Luming Sun, Xiaochun Ye, DongRui Fan, Peng Wu 

Publication date: 17 December 2015

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11936-6_20

Recommendations

• Computer Aided Verification
• Sound and complete monitoring of sequential consistency for relaxed memory models
• scientific article; zbMATH DE number 2102714
• Automatable verification of sequential consistency
• On the verification problem for weak memory models

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical problems of computer architecture (68M07)

Cited In (7)

• Verifying eventual consistency of optimistic replication systems
• Verifying correctness of persistent concurrent data structures: a sound and complete method
• Synchronizability for Verification of Asynchronously Communicating Systems
• Title not available (Why is that?)
• Compact and efficiently verifiable models for concurrent systems
• Title not available (Why is that?)
• Computer Aided Verification

This page was built for publication: Efficiently and completely verifying synchronized consistency models

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