Tag
Introduces an SMT-based pipeline for synthesizing maze solution paths from input patterns and constructing planar and 3D maze structures. Extends a conference paper with detailed construction methods and SMT-LIB examples.
This paper introduces Verifiable Transformers, a framework that converts task-localized Transformer circuits into bounded, solver-checkable claims, enabling formal verification of properties such as functional equivalence, edge necessity, and robustness.