proofs VS dafny

Compare proofs vs dafny and see what are their differences.


My personal repository of formally verified mathematics. (by stepchowfun)


Dafny is a verification-aware programming language (by dafny-lang)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
proofs dafny
5 32
286 2,795
- 5.5%
8.8 9.7
7 days ago 6 days ago
Coq C#
GNU General Public License v3.0 or later GNU General Public License v3.0 or later
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.


Posts with mentions or reviews of proofs. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-09-03.
  • A Taste of Coq and Correct Code by Construction
    3 projects | | 3 Sep 2023
    If you're already familiar with a functional programming language like Haskell or OCaml, you have the prerequisite knowledge to work through my Coq tutorial here:

    My goal with this tutorial was to introduce the core aspects of the language (dependent types, tactics, etc.) in a "straight to the point" kind of way for readers who are already motivated to learn it. If you've heard about proof assistants like Coq or Lean and you're fascinated by what they can do, and you just want the TL;DR of how they work, then this tutorial is written for you.

    Any feedback is appreciated!

  • Thoughts on proof assistants?
    4 projects | /r/ProgrammingLanguages | 13 Dec 2022
    Personally I treat Coq like an extension of my brain. Whenever I'm uncertain about something, I formalize it in Coq. I have a repository of proofs with GitHub Actions set up in such a way forbids me from pushing commits containing mathematical mistakes. I've formalized various aspects of category theory, type theory, domain theory, etc., and I've also verified a few programs, such as this sorting algorithm. Lately I've been experimenting with a few novel types of graphs, proving various properties about them with the aim of eventually developing a way to organize all of my data (files, notes, photos, passwords, etc.) in some kind of graph structure like that.
  • Formally Verifying Rust's Opaque Types
    2 projects | | 1 Aug 2022
    It's always a pleasant surprise to see people using Coq and other formal verification technology. We need more rigor in programming! If this article gave you a thirst for interactive theorem proving and you want to learn it from the ground up, I've recently written a Coq tutorial [1] which covers topics like programming with dependent types, writing proofs as data, and extracting verified code. That repository also contains a handy tactic called `eMagic` [1] (a variant of another useful tactic called `magic` which solve goals with existentials) which can automatically prove the theorem from the article.



  • A complete compiler and VM in 150 lines of code
    4 projects | | 16 Jul 2022
    For anyone who wants to learn Coq, I've just finished writing a tutorial [1] that is aimed at programmers (rather than, say, computer scientists). It covers topics like programming with dependent types, writing proofs as data, universes & other type theory stuff, and extracting verified code—with exercises. I hope people find it useful, and any feedback would be appreciated!


  • New Coq tutorial
    3 projects | /r/ProgrammingLanguages | 5 Jul 2022
    Hi all, Coq is a "proof assistant" that allows you to write both code and proofs in the same language (thanks to the Curry–Howard correspondence). Its uses range from pure math (e.g., the Feit–Thompson theorem was proven in Coq!) to reasoning about programming languages (e.g., proving the soundness of a type system) to writing verified code (e.g., this verified C compiler!). You can "extract" your code (without the proofs) to OCaml/Haskell/Scheme for running it in production. Coq is awesome, but it's known for having a steep learning curve (it's based on type theory, which is a foundational system of mathematics). It took me several years to become proficient in it. I wanted to help people pick it up faster than I did, so I wrote this introductory tutorial. Hope you find it useful!


Posts with mentions or reviews of dafny. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-05-04.
  • Verified Rust for low-level systems code
    6 projects | | 4 May 2024
    For those that are interested but perhaps not aware in this similar project, Dafny is a "verification-aware programming language" that can compile to rust:
  • Dafny is a verification-aware programming language
    4 projects | | 23 Apr 2024
  • Candy – a minimalistic functional programming language
    5 projects | | 24 Feb 2024
  • Dafny – a verification-aware programming language
    1 project | | 28 Nov 2023
  • Lean4 helped Terence Tao discover a small bug in his recent paper
    10 projects | | 27 Oct 2023
    Code correctness is a lost art. I requirement to think in abstractions is what scares a lot of devs to avoid it. The higher abstraction language (formal specs) focus on a dedicated language to describe code, whereas lower abstractions (code contracts) basically replace validation logic with a better model.

    C# once had Code Contracts[1]; a simple yet powerful way to make formal specifications. The contracts was checked at compile time using the Z3 SMT solver[2]. It was unfortunately deprecated after a few years[3] and once removed from the .NET Runtime it was declared dead.

    The closest thing C# now have is probably Dafny[4] while the C# dev guys still try to figure out how to implement it directly in the language[5].






  • The Deep Link Equating Math Proofs and Computer Programs
    5 projects | | 11 Oct 2023
    I don't think something that specific exists. There are a very large number of formal methods tools, each with different specialties / domains.

    For verification with proof assistants, [Software Foundations]( and [Concrete Semantics]( are both solid.

    For verification via model checking, you can check out [Learn TLA+](, and the more theoretical [Specifying Systems](

    For more theory, check out [Formal Reasoning About Programs](

    And for general projects look at [F*]( and [Dafny](

  • Dafny
    1 project | | 13 Sep 2023
  • The Dafny Programming and Verification Language
    1 project | | 6 Sep 2023
  • In Which I Claim Rich Hickey Is Wrong
    5 projects | | 24 Jul 2023
    Dafny and Whiley are two examples with explicit verification support. Idris and other dependently typed languages should all be rich enough to express the required predicate but might not necessarily be able to accept a reasonable implementation as proof. Isabelle, Lean, Coq, and other theorem provers definitely can express the capability but aren't going to churn out much in the way of executable programs; they're more useful to guide an implementation in a more practical functional language but then the proof is separated from the implementation, and you could also use tools like TLA+.

  • Programming Languages Going Above and Beyond
    7 projects | | 29 Jun 2023
    > I think we can assume it won't be as efficient has hand written code

    Actually, surprisingly, not necessarily the case!

    If you'll refer to the discussion in and in, Dafny can statically prove that certain compiler branches are not possible and will never be taken (such as out-of-bounds on index access, logical assumptions about whether a value is greater than or less than some other value, etc). This lets you code in the assumptions (__assume in C++ or unreachable_unchecked() under rust) that will allow the compiler to optimize the codegen using this information.

What are some alternatives?

When comparing proofs and dafny you can also consider the following projects:

CompCert - The CompCert formally-verified C compiler

tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.


FStar - A Proof-oriented Programming Language

hacspec - Please see

rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266

aneris - Program logic for developing and verifying distributed systems

koka - Koka language compiler and interpreter

ccc-talk - Correct Code by Construction talk's code

Rust-for-Linux - Adding support for the Rust language to the Linux kernel.

coq-simple-io - IO for Gallina

interactive - .NET Interactive combines the power of .NET with many other languages to create notebooks, REPLs, and embedded coding experiences. Share code, explore data, write, and learn across your apps in ways you couldn't before.