maurer / holmes
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
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 7 years ago
- ☆22Updated 9 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
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- GoNative project: formal machines models in Coq☆36Updated 7 years ago
- The SAW core language.☆54Updated 3 years ago
- ☆18Updated 7 years ago
- The elf-edit library provides a datatype suitable for reading and writing Elf files.☆36Updated 2 weeks ago
- A Haskell parser for JVM bytecode files☆38Updated last year
- Linux kernel library functions formally verified.☆50Updated 4 years ago
- Formal semantics of LLVM IR in K☆45Updated 6 years ago
- Program analysis grad seminar at SU (2019)☆57Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Bedrock Bit Vector Library☆27Updated last year
- A library for binary analysis and rewriting☆47Updated last year
- Parser for the llvm bitcode format☆60Updated this week
- Distributed Separation Logic: a framework for compositional verification of distributed protocols and their implementations in Coq☆98Updated 7 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- OCaml LLVM bindings tutorial☆22Updated 7 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆50Updated 2 months ago
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- Abstract binding tree code generator☆37Updated 8 years ago
- ☆29Updated 9 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- Patches Assured up to Trace Equivalence☆15Updated last month
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Updated 5 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- The language of the future!☆72Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago