glibc
tlaplus
glibc | tlaplus | |
---|---|---|
25 | 38 | |
1,228 | 2,210 | |
- | 0.8% | |
0.0 | 9.1 | |
over 5 years ago | 3 days ago | |
C | Java | |
GNU General Public License v3.0 or later | 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.
glibc
- `Strlen` in Glibc
-
How does sqrt() work in glibc?
I am writing a short paper for school and the topic is Fast Inverse Square Root and alternatives. One of the questions is how the sqrt-function is implemented in glibc. Here is the code of that function.
-
A collection of lock-free data structures written in standard C++11
The code isn't the easiest to read but in glibc it seems that the syscall is only performed if waiter are detected in userspace during an unlock operation
https://github.com/lattera/glibc/blob/master/nptl/pthread_mu...
-
Converting my new code (Bytearray2Float64) into 19 Programming Language
You might still not realize, but floats are a large topic. Have a look at eg. this implementation here: https://github.com/lattera/glibc/blob/master/stdlib/strtod_l.c
-
Honest question about this "The byte order fallacy" blog post.
This is a nice write up, thank you. However, I'm stilling interpreting this as a "fun trick" rather than the common sense method for solving the problem. For example, looking at the source code for htonl() from glibc: https://github.com/lattera/glibc/blob/master/inet/htonl.c
-
Dio deleted the tweet shortly after
Second of all: The horrifying truth is that there is no such thing as a canonical text representation for IPv4 (source) (and yes... I am indeed citing the failed attempt to standardize this as my source for it not being standardized). Authoritatively speaking, all possible (non-binary) representations are equally invalid. In fact, text address resolution is typically delegated to the OS kernel, so what constitutes a "usable" address is liable to vary depending on if you're using Linux, OSX, Windows, or Other.
-
Discussion Thread
Optimized code gets really weird. The creators of strlen, for example, decided that iterating over each character to find the end was far too slow. So instead, they convert the character pointer into an int pointer and do bitwise manipulation with the int on two different magic numbers so they can check four/eight characters at once.
- Tengo una duda en algo C/C++
-
How does jvm deal with syscalls
If you're using a cross-platform C compiler like gcc or clang, you're usually expected to switch to assembly. Here's the syscall instruction in glibc
-
Math Functions with -nostdlib
Maybe you should include the math part of a libc statically with your code. glibc is one option, or dietlibc if you want it to be as small as possible.
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?
DirectXMath - DirectXMath is an all inline SIMD C++ linear algebra library for use in games and graphics apps
dafny - Dafny is a verification-aware programming language
fastapprox - Approximate and vectorized versions of common mathematical functions
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.
openlibm - High quality system independent, portable, open source libm implementation
apalache - APALACHE: symbolic model checker for TLA+ and Quint
libjxl - JPEG XL image format reference implementation
stateright - A model checker for implementing distributed systems.
nixpkgs - Nix Packages collection & NixOS
awesome-programming-languages - The list of an awesome programming languages that you might be interested in
illumos-gate - An open-source Unix operating system
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala