This work presents a formalization of a library for automata on bit strings. It forms the basis of a reflection-based decision procedure for Presburger arithmetic, which is efficiently executable thanks to Isabelle's code generator. With this work, we therefore provide a mechanized proof of a well-known connection between logic and automata theory. The formalization is also described in a publication [TPHOLs 2009].
- Berghofer, S., & Reiter, M. (2009). Formalizing the Logic-Automaton Connection. Theorem Proving in Higher Order Logics, 147–163. https://doi.org/10.1007/978-3-642-03359-9_12