Home » io.github » uuverifiers

Group: GitHub Uuverifiers
Sort by:Popular▼

1.Princess4 usages

io.github.uuverifiers » princess BSD

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

2.Eldarica2 usages

io.github.uuverifiers » eldarica BSD

Eldarica is an SMT solver for systems of Constrained Horn Clauses (CHC).
Last Release on May 21, 2026

3.Eldarica Tplspec Parser1 usages

io.github.uuverifiers » eldarica-tplspec-parser BSD

Eldarica is an SMT solver for systems of Constrained Horn Clauses (CHC).
Last Release on May 21, 2026

4.Princess Parser1 usages

io.github.uuverifiers » princess-parser BSD

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

5.Princess SMT Parser1 usages

io.github.uuverifiers » princess-smt-parser BSD

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

6.Eldarica CC Parser1 usages

io.github.uuverifiers » eldarica-cc-parser BSD

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

7.Ostrich1 usages

io.github.uuverifiers » ostrich BSD

OSTRICH is an SMT solver for string constraints.
Last Release on Jun 30, 2025

8.OSTRICH ECMA2020 Parser1 usages

io.github.uuverifiers » ostrich-ecma2020-parser BSD

OSTRICH is an SMT solver for string constraints.
Last Release on Jun 30, 2025

9.Horn Concurrency

io.github.uuverifiers » horn-concurrency BSD

Encoding of concurrent or replicated programs using Horn clauses
Last Release on May 23, 2026