apalache

APALACHE: symbolic model checker for TLA+ and Quint (by informalsystems)

Apalache Alternatives

Similar projects and alternatives to apalache

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better apalache alternative or higher similarity.

apalache reviews and mentions

Posts with mentions or reviews of apalache. 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 | news.ycombinator.com | 4 May 2024
    TLA+ has also had an SMT-based backend, Apalache [1], for a few years now. In general, you encode your system model (which would be the Rust functions for Verus, the TLA model for Apalache) and your desired properties into an SMT formula, and you let the solver have a go at it. The deal is that the SMT language is quite expressive, which makes such encodings... not easy, but not impossible. And after you're done with it, you can leverage all the existing solvers that people have built.

    While there is a series of "standard" techniques for encoding particular program languages features into SMT (e.g., handling higher-order functions, which SMT solves don't handle natively), the details of how you encode the model/properties are extremely specific to each formalism, and you need to be very careful to ensure that the encoding is sound. You'd need to go and read the relevant papers to see how this is done.

    [1]: https://apalache.informal.systems

  • Holiday protocols: secret Santa with Quint
    3 projects | news.ycombinator.com | 21 Dec 2023
  • Learn TLA+
    3 projects | news.ycombinator.com | 28 Sep 2022
    Anyone know of some good free software TLA+ model checkers? The "Other Tooling" mentions one alternative checker, https://apalache.informal.systems/, but that's all I could find. Thanks.
  • Apalache – Symbolic Model Checker for TLA+
    1 project | news.ycombinator.com | 27 Sep 2022
  • A dependently typed language for proofs that you can implement in one day
    4 projects | news.ycombinator.com | 1 Oct 2021
    > How are those types any different than outright stating a behavioral invariant?

    Because the behavior of programs can't be verified without executing the program, but types can be checked purely based on syntax. There is way less source code than runtime states of any non-trivial program.

    I've asked this same question many times, the TLA+ way is much more expressive and _simpler_. But model checking is a way harder problem than type checking, in general. SMT solvers make this line blurry - in fact, have you heard of the SMT-based model checker for TLA+, [Apalache](https://apalache.informal.systems/)?. I haven't tried it out, but that should be way faster than TLC which just brute forces the state-space exploration.

    I'm totally with you about TLA+ style spec properties, but it's a big theoretical hurdle to cross before they could be as efficient as types.

  • Apalache Release v0.15.1
    1 project | /r/tlaplus | 7 Apr 2021
  • Apalache, a symbolic model checker for TLA+, v0.8.0 is released
    1 project | /r/tlaplus | 7 Jan 2021
  • A note from our sponsor - SaaSHub
    www.saashub.com | 2 Jun 2024
    SaaSHub helps you find the best software and product alternatives Learn more →

Stats

Basic apalache repo stats
7
414
9.3
15 days ago

informalsystems/apalache is an open source project licensed under Apache License 2.0 which is an OSI approved license.

The primary programming language of apalache is Scala.


Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com