atsam4-hal
tlaplus
| atsam4-hal | tlaplus | |
|---|---|---|
| 1 | 38 | |
| 5 | 2,219 | |
| - | 1.2% | |
| 4.8 | 9.1 | |
| 3 months ago | 7 days ago | |
| Rust | Java | |
| Apache License 2.0 | MIT License |
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.
atsam4-hal
-
James Web Space Telescope runs on C++ code.
Sorry to hear you ran into some issues, which specific ATMEL chip was it? It appears there are already HALs for ATMEL see here: https://github.com/atsam-rs/atsam4-hal
tlaplus
- Ask HN: Usefulness of formal verification (Coq) and formal verification (TLA+)?
-
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+.
https://dafny.org/
https://whiley.org/
https://www.idris-lang.org/
https://isabelle.in.tum.de/
https://leanprover.github.io/
https://coq.inria.fr/
http://lamport.azurewebsites.net/tla/tla.html
-
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.
- Ask HN: How you understand TLA+ and how you use TLA+ in your projects?
-
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.
https://lamport.azurewebsites.net/tla/tla.html
- 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)).
-
How do I get the set of process identifier of PlusCal?
The pcal generator does *not* generate a definition for the set of labels. However, some users have suggested to add such a feature: https://github.com/tlaplus/tlaplus/issues/613
What are some alternatives?
Corinna - Corinna - Bring Modern OO to the Core of Perl
dafny - Dafny is a verification-aware programming language
stm32f1xx-hal - A Rust embedded-hal HAL impl for the STM32F1 family based on japarics stm32f103xx-hal
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.
apalache - APALACHE: symbolic model checker for TLA+ and Quint
stateright - A model checker for implementing distributed systems.
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
daisy-nfsd - DaisyNFS is an NFS server verified using Dafny and Perennial.
advent-of-tla - AoC goals in TLA+
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#