FStar
oot
Our great sponsors
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.
FStar
- Lean4 helped Terence Tao discover a small bug in his recent paper
-
The Deep Link Equating Math Proofs and Computer Programs
I don't think something that specific exists. There are a very large number of formal methods tools, each with different specialties / domains.
For verification with proof assistants, [Software Foundations](https://softwarefoundations.cis.upenn.edu/) and [Concrete Semantics](http://concrete-semantics.org/) are both solid.
For verification via model checking, you can check out [Learn TLA+](https://learntla.com/), and the more theoretical [Specifying Systems](https://lamport.azurewebsites.net/tla/book-02-08-08.pdf).
For more theory, check out [Formal Reasoning About Programs](http://adam.chlipala.net/frap/).
And for general projects look at [F*](https://www.fstar-lang.org/) and [Dafny](https://dafny.org/).
-
If You've Got Enough Money, It's All 'Lawful'
Don't get me wrong, there are times when Microsoft got it right the first time that was technically far superior to their competitors. Windows IOCP was theoretically capable of doing C10K as far back in 1994-95 when there wasn't any hardware support yet and UNIX world was bickering over how to do asynchronous I/O. Years later POSIX came up with select which was a shoddy little shit in comparison. Linux caved in finally only as recently as 2019 and implemented io_uring. Microsoft research has contributed some very interesting things to computer science like Z3 SAT solver and in collaboration with INRIA made languages like F* and Low* for formal specification and verification. But all this dwarfs in comparison to all the harm they did.
-
What are the current hot topics in type theory and static analysis?
Most of the proof assistants out there: Lean, Coq, Dafny, Isabelle, F*, Idris 2, and Agda. And the main concepts are dependent types, Homotopy Type Theory AKA HoTT, and Category Theory. Warning: HoTT and Category Theory are really dense, you're going to really need to research them.
-
Why is there no simple C-like functional programming language?
F* is a dependently typed language that can be transpiled to idiomatic C via the KReMLin compiler. It’s very ML-ish to write and you can leave out some proofs. It also has the benefit of being used to write a formally verified TLS implementation that’s in wide use throughout industry.
-
[Media] Genetic algorithm simulation - Smart rockets (code link in comments)
As I said, dependent types attempt to solve this problem. F* is a language where you can express complex logic as a type. The catch is, these types are checked by an SMT solver. If the solver can satisfy the type checking, then great, and you move on. If it can’t, you have no idea why, and either have to guess or manually write the proof anyway. Contrast this with Standard ML which has a proof of the soundness of its type system.
-
Prop v0.42 released! Don't panic! The answer is... support for dependent types :)
So kind of like F*? https://www.fstar-lang.org/
-
old languages compilers
F*
-
Pegasus spyware was used to hack reporters’ phones. I’m suing its creators; When you’re infected by Pegasus, spies effectively hold a clone of your phone – we’re fighting back.
Nevermind that academia has come up with far safer ways to do a few things but social norms & inertia prevent their wider adoption (well okay, it also has a barrier to entry in the education required to use it but I don't think someone with the knowledge to meaningfully contribute to an OS kernel can be considered uneducated nor unable to learn).
-
[Hobby] Amateur Generalist Programmer Seeking to Put Bugfixing Skills to Good Use
Maybe that's a little off topic here, but if you like fixing bugs, i suspect you might also enjoy showing that there are no bugs at all. Check out languages like F* https://www.fstar-lang.org/ It's a proof-oriented programming language. You can use it to write code that has no bugs at all. And you once you're done, can convert F* to C or other languages.
oot
- Can anyone get Zelda Majoras Mask and Ocarina of Time working on Garlic OS?
-
Other decomps like SM64Decomp
https://github.com/zeldaret/oot 100% Ocarina of Time is fully decomped, surprised we haven't seen any developments on Mario here. Also liboot is possible.
- Anyone know of any resources that explain decompiling and how its done?
-
Why is Rosetta 2 fast?
Here's the page from the Zelda "Reverse Engineer" GitHub wiki: https://github.com/zeldaret/oot/wiki/Getting-Started
-
Please stop asking if MWII will be cracked
well it is possible to crack a game without the source. in fact, it's possible to decompile source from the binary itself. This has been done with Mario64 and ocarina of time.
-
I want to make a Zelda OOT hack but I'm just too noob.
That being said, there is a lot of documentation out there on Ocarina of Time specifically. There's even a work-in-progress decompilation. You're going to have to learn a lot to get to the level where you can do the stuff you're wanting to do, but that's part of why you have to try to start smaller. You can even work on Ocarina of Time still, but start by picking a concrete goal and trying to hack it into the game. Build a tool from scratch that replaces text in the game, for example.
-
Apparently the GTA 6 leaker sold the GTA V source code through a telegram group before getting arrested, according to the admin who verifies the buyer's claim, uploads a new screenshot of the source code
Mario 64 and Ocarina of Time were only just decompiled within the last couple of years. Jak and Daxter 1 was decompiled a few months ago. GTA 3 and Vice City have nearly finished decompilations, but TakeTwo took legal action against the developers before they put the finishing touches.
-
Having issues with the Wii Virtual Console version of SM64, parts of the ground are not rendering correctly. What can I do to fix this?
That said, I did my research before talking about source ports made from restoring the (nearly) original code using the compiled data and symbols). That's how SM64 and OoT (as well as other Zeldas in progress) were/are decompiled.
-
[OoT] Did you know that Ocarina of Time has some hilarious piracy measures? If the N64 detects your game is pirated, Zelda abandons you in the escape from Ganon's castle, and has ridiculous hair when she reveals herself as Sheik
I've watched the video and I'm still convinced it provides false information. What is my source? The official OoT decompilation project: https://github.com/zeldaret/oot
- First game beat on my RP2+, Ocarina of Time!! (sorry for poo lighting, it's storming and I have the lamp dimmed for the vibes)
What are some alternatives?
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.
sm64-vita - A port of https://www.github.com/sm64-port/sm64-port for the PS Vita
lean - Lean Theorem Prover
Vita-Nearest-Neighbour - Plugin that makes blurry textures sharper by changing scaling algorithm
dafny - Dafny is a verification-aware programming language
sm64 - A Super Mario 64 decompilation, brought to you by a bunch of clever folks.
koka - Koka language compiler and interpreter
citra - A Nintendo 3DS Emulator
stepmania - Advanced rhythm game for Windows, Linux and OS X. Designed for both home and arcade use.
SDL - DEPRECATED: Official development moved to GitHub
VisualFSharp - The F# compiler, F# core library, F# language service, and F# tooling integration for Visual Studio
project64 - N64 Emulator