Formalizing the Logic-Automaton Connection
From MaRDI portal
Recommendations
Cites work
- Combining WS1S and HOL
- scientific article; zbMATH DE number 1696436 (Why is no real title available?)
- scientific article; zbMATH DE number 1223628 (Why is no real title available?)
- scientific article; zbMATH DE number 1538036 (Why is no real title available?)
- scientific article; zbMATH DE number 2085164 (Why is no real title available?)
- Linear Quantifier Elimination
- Partial Recursive Functions in Higher-Order Logic
- Proof synthesis and reflection for linear arithmetic
- Verified Decision Procedures on Context-Free Grammars
Cited in
(13)- Regular language representations in the constructive type theory of Coq
- Formal logics of discovery and hypothesis formation by machine
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- Automatic refinement to efficient data structures: a comparison of two approaches
- Two-Way Automata in Coq
- Verified synthesis of knowledge-based programs in finite synchronous environments
- A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
- Presburger Automata
- scientific article; zbMATH DE number 1341537 (Why is no real title available?)
- scientific article; zbMATH DE number 1342250 (Why is no real title available?)
- scientific article; zbMATH DE number 2038699 (Why is no real title available?)
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Partial and nested recursive function definitions in higher-order logic
Describes a project that uses
Uses Software
This page was built for publication: Formalizing the Logic-Automaton Connection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183526)