alive2
x86-sat
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.
alive2
-
Basic SAT model of x86 instructions using Z3, autogenerated from Intel docs
You can use it to (mostly) validate small snippets are the same. See Alive2 for the application of Z3/formalization of programs as SMT for that [1]. As far as I'm aware there are some problems scaling up to arbitrarily sized programs due to a lack of formalization in higher level languages in addition to computational constraints. With a lot of time and effort it can be done though [2].
1. https://github.com/AliveToolkit/alive2
2. https://sel4.systems/
- John Regehr: Alive2 LLVM optims verification
-
Verifying GCC optimizations using an SMT solver
Yeah, this kind of thing is nice.
Alive had been used for years (almost a decade actually) by people to verify LLVM instcombine transforms.
Alive2 (https://github.com/AliveToolkit/alive2) makes it easier to do the same with most optimization passes.
-
Programming in Z3 by learning to think like a compiler
Alive/Alive2 [1] is one of the most famous frameworks for compiler transformation verification using BitVec logic
[1] https://github.com/AliveToolkit/alive2
x86-sat
-
My First Superoptimizer
Better than brute force is using a model of your instruction set (x86 start here [1]), then using something like Z3 [] to find solutions. Here's a paper doing the same [2]. With these approaches you can get vastly bigger pieces of code generated than brute force, and with significantly less hand heuristic tuning effort (which likely still loses out to current solvers).
[1] https://github.com/zwegner/x86-sat
[2] https://people.cs.umass.edu/~aabhinav/Publications/Unbounded...
- Basic SAT model of x86 instructions using Z3, autogenerated from Intel docs
What are some alternatives?
CrossHair - An analysis tool for Python that blurs the line between testing and type systems.
seL4 - The seL4 microkernel
klee - KLEE Symbolic Execution Engine
recreational-rosette - Some fun examples of solving problems with symbolic execution
zz - 🍺🐙 ZetZ a zymbolic verifier and tranzpiler to bare metal C
Symbolica - Symbolica's open-source symbolic execution engine. [Moved to: https://github.com/Symbolica/Symbolica]
llvm-tutor - A collection of out-of-tree LLVM passes for teaching and learning
Cassius - A CSS specification and reasoning engine
sprdpl - Simple Python Recursive-Descent Parsing Library
angr - A powerful and user-friendly binary analysis platform!
taxoptimizer
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.