Formalizing the Logic-Automaton Connection

Authors:
Stefan Berghofer;Markus Reiter
Affiliations:
Institut für Informatik, Technische Universität München, Garching, Germany 85748;Institut für Informatik, Technische Universität München, Garching, Germany 85748
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 12
Cited 6

Constructively formalizing automata theory

Proof, language, and interaction
Using Reflection to Build Efficient and Certified Decision Procedures

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Reflecting BDDs in Coq

ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
On the Construction of Automata from Linear Arithmetic Constraints

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Verified Lexical Analysis

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Mona & Fido: The Logic-Automaton Connection in Practice

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Diophantine Equations, Presburger Arithmetic and Finite Automata

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Proof Synthesis and Reflection for Linear Arithmetic

Journal of Automated Reasoning
Linear Quantifier Elimination

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Verified decision procedures on context-free grammars

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Partial recursive functions in higher-order logic

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Verified synthesis of knowledge-based programs in finite synchronous environments

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
The isabelle collections framework

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Verified decision procedures for MSO on words based on derivatives of regular expressions

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Light-Weight containers for isabelle: efficient, extensible, nestable

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a formalization of a library for automata on bit strings in the theorem prover Isabelle/HOL. 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 the well-known connection between logic and automata theory.