An ISA-level memory consistency model for tākō is introduced and proven sound by verifying that executions of an implementation model are permitted by the model.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.
citing papers explorer
-
t\"{a}k\={o}Formal: Enabling Robust Software for Programmable Memory Hierarchies (Extended Version)
An ISA-level memory consistency model for tākō is introduced and proven sound by verifying that executions of an implementation model are permitted by the model.
-
Extending QuAK with Nested Quantitative Automata
Extends QuAK with flattening reductions from nested quantitative automata to quantitative automata, enabling analysis of unbounded quantitative properties via existing decision procedures.