Implied Set Closure and Its Application to Memory Consistency Verification
No abstract available.
Related papers
- What's Decidable About Causally Consistent Shared Memory? TOPLAS 2022
- The Complexity of Testing Message-Passing Concurrency POPL 2026
- Trade-offs Between False Sharing and Aggregation in Software Distributed Shared Memory PPoPP 1997
- Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures POPL 2026
- Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems CAV 2020
- Dynamic Robustness Verification against Weak Memory PLDI 2025
- Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models TOPLAS 2023
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints VMCAI 2008