dynaroars / dig
DIG is a numerical invariant generation tool. It infers program invariants or properties over (i) program execution traces or (ii) program source code. DIG supports many forms of numerical invariants, including nonlinear equalities, octagonal and interval properties, min/max-plus relations, and congruence relations.
☆39Updated 4 months ago
Alternatives and similar repositories for dig:
Users that are interested in dig are comparing it to the libraries listed below
- Precise and Signedness Agnostic Interval Analysis for LLVM IR -- This website is obsolete. However, the wrapped interval domain is now im…☆12Updated 7 years ago
- Fuzzer and generator for string and regex problems in SMT-LIB 2.x format.☆20Updated 3 years ago
- Symbolic Program Slicing with LLVM☆76Updated 4 years ago
- Public-facing course info for program analysis materials.☆38Updated last month
- Version of IKOS abstract interpreter implementing parallel deterministic fixpoint computation☆16Updated 4 years ago
- Map2Check: Finding Software Vulnerabilities☆27Updated 4 years ago
- KLEE / CSE Project☆43Updated 4 years ago
- A framework for testing compilers' type checkers☆17Updated 2 months ago
- ☆25Updated 3 years ago
- A tool for analyzing LLVM bitcode using Datalog.☆99Updated 4 years ago
- Dynamic Analysis for Concurrent Programs☆22Updated 3 months ago
- A tool for testing SMT solvers for incompleteness bugs☆15Updated 2 years ago
- UFO: Predictive Detection of Concurrency Use-After-Free Vulnerabilities☆32Updated 4 years ago
- A high-performance, parallel, compilation-based symbolic execution engine☆127Updated this week
- A Fast Floating-Point Satisfiability Solver☆21Updated 6 years ago
- Experimental translation of llvm to smt.☆56Updated 4 years ago
- Enumerative Testing and Bounded Validation of SMT Solvers☆22Updated 3 months ago
- A unification-based alias analysis and related tools☆31Updated 3 months ago
- Static range analysis for the LLVM compiler infrastructure.☆55Updated 5 years ago
- SymDiff-Differential-Program-Verifier☆34Updated this week
- Efficient Sampling of SAT Solutions for Testing☆34Updated 5 years ago
- A precise and scalable pointer analysis for LLVM, written in Ascent☆62Updated 3 weeks ago
- The ISLa (Input Specification Language) language & solver.☆62Updated 6 months ago
- Code2Inv: Learning Loop Invariants for Program Verification☆88Updated 4 years ago
- Learning to Solve SMT Formulas Fast☆85Updated 7 months ago
- ☆19Updated last year
- Files and tools for SMT-COMP, the International Satisfiability Modulo Theories Competition.☆28Updated last week
- UBGen can generate programs with undefined behaviors (e.g., buffer-overflow, use-after-free, etc.)☆57Updated 9 months ago
- ☆27Updated 4 months ago
- ☆17Updated 2 months ago