Group: GitHub Uuverifiers
Sort by:Popular

1. Princess4 usages

io.github.uuverifiers » princessBSD

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Last Release on Apr 2, 2025

2. Ostrich1 usages

io.github.uuverifiers » ostrichBSD

OSTRICH is an SMT solver for string constraints.
Last Release on Nov 12, 2024

3. Eldarica CC Parser1 usages

io.github.uuverifiers » eldarica-cc-parserBSD

Eldarica is an SMT solver for systems of Constrained Horn Clauses (CHC).
Last Release on Apr 24, 2025

4. Princess SMT Parser1 usages

io.github.uuverifiers » princess-smt-parserBSD

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Last Release on Apr 2, 2025

5. Princess Parser1 usages

io.github.uuverifiers » princess-parserBSD

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Last Release on Apr 2, 2025
Eldarica is an SMT solver for systems of Constrained Horn Clauses (CHC).
Last Release on Apr 24, 2025
OSTRICH is an SMT solver for string constraints.
Last Release on Nov 12, 2024

8. Eldarica

io.github.uuverifiers » eldaricaBSD

Eldarica is an SMT solver for systems of Constrained Horn Clauses (CHC).
Last Release on Apr 24, 2025