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.
☆55May 24, 2025Updated 9 months ago
Alternatives and similar repositories for dig
Users that are interested in dig are comparing it to the libraries listed below
Sorting:
- ☆12Dec 29, 2022Updated 3 years ago
- DPLL(T)-based Verification tool for DNNs☆30Updated this week
- MemLock: Memory Usage Guided Fuzzing☆32Jun 30, 2020Updated 5 years ago
- TRACER Symbolic Execution Tool☆28Jun 16, 2020Updated 5 years ago
- Open source release from our ICLR 2020 paper, CLN2INV: Learning Loop Invariants with Continuous Logic Networks.☆21Jun 8, 2020Updated 5 years ago
- Static Analyzer for LLVM bitcode based on Abstract Interpretation. **Update**: clam is still actively maintained. Please use branch dev1…☆287Apr 21, 2024Updated last year
- A formally verified bug finder☆14Nov 25, 2024Updated last year
- ICRA: a static analyzer based on interprocedural compositional recurrence analysis☆11Feb 27, 2020Updated 6 years ago
- [ICSE 2022] Controlled Concurrency Testing via Periodical Scheduling☆36Oct 9, 2022Updated 3 years ago
- ☆20May 30, 2024Updated last year
- ☆13Nov 14, 2023Updated 2 years ago
- ☆11Oct 28, 2020Updated 5 years ago
- Duet: static analysis for unbounded concurrency☆30Feb 6, 2026Updated last month
- A parser and AST for Lustre☆12Oct 30, 2024Updated last year
- ☆15Sep 14, 2022Updated 3 years ago
- QUICr parametric abstract domain for sets☆12Jul 2, 2015Updated 10 years ago
- Dynamic detection of likely invariants☆246Mar 14, 2026Updated last week
- Cyclic theorem prover for equalitional reasoning using egraphs☆27Oct 24, 2023Updated 2 years ago
- The Use of Likely Invariants as Feedback for Fuzzers☆94Jan 19, 2022Updated 4 years ago
- Scalable Validator for Binary Lifters☆62Jun 28, 2020Updated 5 years ago
- Interesting papers☆11Jun 22, 2024Updated last year
- An automated deductive program verifier.☆43Mar 2, 2023Updated 3 years ago
- This is solc-verify, a modular verifier for Solidity.☆53Sep 5, 2023Updated 2 years ago
- MachSMT: An ML-Driven Algorithm Selection tool for SMT Solvers☆25Apr 21, 2023Updated 2 years ago
- Code2Inv: Learning Loop Invariants for Program Verification☆104Jan 26, 2021Updated 5 years ago
- Generates loop invariants for program verification☆63Jan 22, 2021Updated 5 years ago
- easter egg is a flexible, high-performance e-graph library with support of multiple additional assumptions at once☆13Mar 27, 2025Updated 11 months ago
- Binsec/Haunted is an extension of Binsec to verify speculative constant-time and detect Spectre attacks.☆18Oct 19, 2023Updated 2 years ago
- Intrepyd Model Checker☆18Nov 5, 2021Updated 4 years ago
- Linux kernel library functions formally verified.☆61Jan 11, 2026Updated 2 months ago
- Tools for manipulating CHC and related files☆15Apr 21, 2023Updated 2 years ago
- Iodine: Verifying Constant-Time Execution of Hardware☆15Mar 29, 2021Updated 4 years ago
- Experimental translation of llvm to smt.☆59Apr 8, 2020Updated 5 years ago
- Program analysis tools developed at Draper on the CBAT project.☆106Apr 13, 2023Updated 2 years ago
- tree-sitter grammar for the CodeQL language☆34Aug 29, 2025Updated 6 months ago
- Genetic program repair using GHC☆33May 16, 2024Updated last year
- Apron Numerical Abstract Domain Library☆144Feb 13, 2026Updated last month
- BTOR2 MLIR project☆26Jan 17, 2024Updated 2 years ago
- Synthesis of Loop-free Programs in Rust☆67Feb 27, 2020Updated 6 years ago