Cover Image

How to Verify a Turing Machine with Dafny

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lederer, Edgar F. A.
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science F.1.1; F.3.1; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Turing machines deciders, part I
by: The bbchallenge Collaboration, et al.
Published: (2025)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
by: Backhouse, Roland, et al.
Published: (2023)

Probabilistic Epistemic Dynamic Agentive Logic
by: Logan, Shay Allen
Published: (2026)

The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
by: Hellwig, Jonathan, et al.
Published: (2025)

The Thins Ordering on Relations
by: Voermans, Ed, et al.
Published: (2024)

Diagonals and Block-Ordered Relations
by: Backhouse, Roland, et al.
Published: (2024)

Verifying Tree-Manipulating Programs via CHCs
by: Faella, Marco, et al.
Published: (2025)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

Symmetries in Sorting
by: Choudhury, Vikraman, et al.
Published: (2025)

Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)

A Type Theory for Probabilistic and Bayesian Reasoning
by: Adams, Robin, et al.
Published: (2015)

Simple Types for Polymorphic Functions
by: Jay, Barry, et al.
Published: (2026)

LeanLTL: A unifying framework for linear temporal logics in Lean
by: Vin, Eric, et al.
Published: (2025)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)

Uniform Substitution for Differential Refinement Logic
by: Prebet, Enguerrand, et al.
Published: (2024)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
by: Borzechowski, Manfred, et al.
Published: (2025)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Well-Scoped Locally Nameless Representation of Syntax
by: Pitts, Andrew M.
Published: (2026)

Strategies, model checking and branching-time properties in Maude
by: Rubio, Rubén, et al.
Published: (2024)

Model checking strategy-controlled systems in rewriting logic
by: Rubio, Rubén, et al.
Published: (2024)

Metalevel transformation of strategies
by: Rubio, Rubén, et al.
Published: (2024)

From Zonotopes to Proof Certificates: A Formal Pipeline for Safe Control Envelopes
by: Hellwig, Jonathan, et al.
Published: (2025)

Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)

Genericity Through Stratification
by: Arrial, Victor, et al.
Published: (2024)

AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)

What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

Conformance Games for Graded Semantics
by: Forster, Jonas, et al.
Published: (2024)

Compositional Separation of Control Flow and Data Flow
by: Arellanes, Damian
Published: (2023)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
by: Sundaram, Aarthi, et al.
Published: (2021)