CMSO-transductions are given for the modular, split and bi-join decompositions of graphs, plus a generalization to weakly-partitive set systems.
Definability equals recognizability for graphs of bounded treewidth
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.
citing papers explorer
-
An MSO Framework for Weak-Memory Verification and Robustness
The paper establishes treewidth bounds and MSO-axiomatizability results for weak memory models, introduces reads-from robustness, and derives algorithmic implications for verification.