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
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
WybeCoder interleaves code generation, invariant synthesis, and proof construction to produce verified imperative programs, solving 74% of Verina tasks and 62% of Clever tasks while surpassing prior results.
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.
-
WybeCoder: Verified Imperative Code Generation
WybeCoder interleaves code generation, invariant synthesis, and proof construction to produce verified imperative programs, solving 74% of Verina tasks and 62% of Clever tasks while surpassing prior results.