Implied Set Closure and Its Application to Memory Consistency Verification

DOI10.1007/978-3-540-70545-1_11MaRDI QIDQ3512486zbMATH OpenOpenAlexFDO

Authors Surender Baswana, Shashank K. Mehta, Vishal Powar

Publication date 15 July 2008

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70545-1_11

zbMATH Keywords

total store orderincremental transitive closurememory consistency model verificationshared memory multi-processor

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Languages and Compilers for Parallel Computing
• scientific article; zbMATH DE number 2102714
• Boosting Sequential Consistency Checking Using Saturation
• Testing Shared Memories
• scientific article; zbMATH DE number 1903349

Cites work

• Amortized efficiency of a path retrieval data structure

Describes a project that uses

Uses Software

• TSOTool

This page was built for publication: Implied Set Closure and Its Application to Memory Consistency Verification

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