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. Learn more →
Tlaplus Alternatives
Similar projects and alternatives to tlaplus
-
-
coq
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
-
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.
-
-
-
-
awesome-programming-languages
The list of an awesome programming languages that you might be interested in
-
adventofcode
Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala (by sim642)
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
quint
An executable specification language with delightful tooling based on the temporal logic of actions (TLA) (by informalsystems)
-
-
-
-
-
-
-
tauri
Build smaller, faster, and more secure desktop applications with a web frontend.
-
-
CppCoreGuidelines
The C++ Core Guidelines are a set of tried-and-true guidelines, rules, and best practices about coding in C++
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
tlaplus reviews and mentions
-
Quint: A specification language based on the temporal logic of actions (TLA)
```
https://github.com/tlaplus/tlaplus/blob/master/tlatools/org....
In any case, our whole team thinks TLA is great, and we're happy people like you and Ron find it so useful and insightful. We also think it is a very insightful.
-
Concurrent Data-structure Design Walk-Through
There are no tests! There are various ways to test concurrent data structures. You could use a stress test, where you spawn a lot of threads and let them mutate the map in a random way and then check the consistency of the map and some invariants. You could learn TLA+ and write a formal model of the map and then verify it.
-
In Which I Claim Rich Hickey Is Wrong
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
I wish something like Lamport's TLA+ (https://lamport.azurewebsites.net/tla/tla.html) was supported in modern language compilers - perhaps with annotations/macros and a mini formal DSL.
-
A collection of lock-free data structures written in standard C++11
Checking the invariant with assert is also useful in my limited experience with concurrency.
- Ask HN: Is writing a math proof like programming without ever running your code?
-
What I've Learned About Formal Methods in Half a Year
One advantage of formal methods is in determining "what was expected" (including all the goofy edge cases) without having to burrow into the details of code.
Take a look at Alloy (http://alloytools.org/) and TLA+ (https://lamport.azurewebsites.net/tla/tla.html) for example. (Or even the ancient Z ("Zed") notation (https://www.cs.cmu.edu/~15819/zedbook.pdf)).
-
Can we make useful streaming APIs that disallow deadlocks?
I think that the traits in this library could be amenable to a proof of lock free behaviour at least for graphs composed entirely of Uniform flow nodes. but right now it's just a hunch. I a little while thinking about it over the last couple of weeks, but a proof, if forthcoming, will definitely be more complicated than I originally hoped. So to the second point of the post title/question does this really disallow deadlocks? I don't know. I think I'll definitely need some kind of proof assistant, and write now am thinking about TLA+, because of it's ability to reason about concurrent systems.
- Benefits to not unit testing every class?
-
How has studying Mathematics changed/shaped your worldview?
Leslie Lamport's TLA+ is also good, but that's used more for reasoning about distributed systems https://lamport.azurewebsites.net/tla/tla.html
-
A note from our sponsor - InfluxDB
www.influxdata.com | 28 Mar 2024
Stats
tlaplus/tlaplus is an open source project licensed under MIT License which is an OSI approved license.
The primary programming language of tlaplus is Java.