An offline analyzer that over-approximates reachable states of piecewise-linear hybrid systems and returns safety certificates or uncertainty regions.
A from-scratch satisfiability-modulo-theories laboratory combining a CDCL SAT core with congruence closure and difference logic.
An offline verifier that decides whether concurrent operation histories admit a legal sequential explanation and emits a compact witness or minimal violation.
A local model checker for finite Markov chains and decision processes that computes reachability probabilities, expected costs, and adversarial schedulers.
A counterexample-guided engine that learns loop invariants for a small imperative language and checks each candidate with an SMT-backed verifier.
An interactive verifier for pointer-manipulating programs that checks separation-logic contracts and visualizes heap entailment and frame inference.
A local data-transformation engine whose operators emit compact certificates that a separate checker uses to verify row conservation and declared invariants.
To associate your repository with the formal-methods-verification topic, visit your repo's landing page and select "manage topics."