maurer / holmesLinks
Datalog engine with extensions for integrating analyses
☆38Updated 7 years ago
Alternatives and similar repositories for holmes
Users that are interested in holmes are comparing it to the libraries listed below
Sorting:
- ☆22Updated 9 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A Haskell parser for JVM bytecode files☆38Updated last year
- ☆29Updated 9 years ago
- The elf-edit library provides a datatype suitable for reading and writing Elf files.☆39Updated last month
- ☆18Updated 8 years ago
- BDD-based implementation of Datalog☆37Updated 4 years ago
- The SAW core language.☆54Updated 3 years ago
- The language of the future!☆72Updated last year
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Program analysis grad seminar at SU (2019)☆57Updated 5 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- OCaml LLVM bindings tutorial☆21Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- Bedrock Bit Vector Library☆27Updated last year
- ☆33Updated 10 years ago
- Stratified synthesis for learning machine code instruction semantics☆37Updated 3 weeks ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Updated 10 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- GoNative project: formal machines models in Coq☆36Updated 7 years ago
- A Haskell-only implementation of zlib / DEFLATE.☆31Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 4 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago