smanikin
apalache
Our great sponsors
smanikin | apalache | |
---|---|---|
5 | 6 | |
2 | 409 | |
- | 4.9% | |
0.0 | 9.5 | |
over 2 years ago | 6 days ago | |
Scala | Scala | |
Apache License 2.0 | Apache License 2.0 |
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.
smanikin
-
FP or OOP
Yes, this is essentially event-sourced Manikin. You can even have retro-active events, base on git-like patterns (merge, rebase). See Concurrent Worlds and the implementation
-
What programming languages distinguish between “old” and “new” values?
Would a library like Manikin (or rather DSL) also count?
-
A Mini-Project with Scala, Akka, Cassandra and Cats
FYI: I've implemented another approach based on concurrent worlds. With this system, objects look a bit like Actors, but are essentially purely functional objects.
-
Incorporating a Modelling DSL into an Imperative Programming Language
I've created an embedded DSL, called Manikin that is close to what you are after.
-
Manikin: Concurrent Worlds
Hi, I've recently finished two posts on a framework called Manikin that I want to share with the community.
apalache
- Holiday protocols: secret Santa with Quint
-
Learn TLA+
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+
-
A dependently typed language for proofs that you can implement in one day
> 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
- Apalache, a symbolic model checker for TLA+, v0.8.0 is released
What are some alternatives?
metorikku - A simplified, lightweight ETL Framework based on Apache Spark
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
OpenMOLE - Workflow engine for exploration of simulation models using high throughput computing
Formality - A modern proof language [Moved to: https://github.com/kind-lang/Kind]
jmanikin - Core Java API of Manikin
advent-of-tla - AoC goals in TLA+
BlockingQueue - Tutorial "Weeks of debugging can save you hours of TLA+". Each git commit introduces a new concept => check the git history!
ewd998 - Distributed termination detection on a ring, due to Shmuel Safra:
suslik - Synthesis of Heap-Manipulating Programs from Separation Logic
PomPom-Language - The cuteness implementation of a dependently typed language.
P - The P programming language.