Formalizing the Logic-Automaton Connection (Q7361774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Presburger-Automata
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formalizing the Logic-Automaton Connection |
AFP entry Presburger-Automata |
Statements
Stefan Berghofer
0 references
Markus Reiter
0 references
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].
0 references
3 December 2009
0 references
Formalizing the Logic-Automaton Connection (English)
0 references
