### Abstract

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].

### License

BSD License

### Topics

- Computer science/Automata and formal languages
- Logic/General logic/Decidability of theories

### Related publications

- 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

### Session Presburger-Automata

- DFS
- Presburger_Automata
- Exec

## Cite

×

Presburger-Automata-AFP

    @article{Presburger-Automata-AFP,
      author  = {Stefan Berghofer and Markus Reiter},
      title   = {Formalizing the Logic-Automaton Connection},
      journal = {Archive of Formal Proofs},
      month   = {December},
      year    = {2009},
      note    = {\url{https://isa-afp.org/entries/Presburger-Automata.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Dec 11, 2013 : Isabelle2013-2
- Nov 17, 2013 : Isabelle2013-1
- Mar 2, 2013 : Isabelle2013
- Feb 16, 2013 : Isabelle2013
- May 24, 2012 : Isabelle2012
- Oct 11, 2011 : Isabelle2011-1
- Feb 11, 2011 : Isabelle2011
- Jul 1, 2010 : Isabelle2009-2
- Dec 12, 2009 : Isabelle2009-1