Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Latest Versions
51 versions →| Version ▼ | Scala | Vulnerabilities | Usages | Date | |
|---|---|---|---|---|---|
.x | 2026-05-20 | 2.11 |
2
| May 20, 2026 | |
| 2025-11-17 | 2.11 |
2
| Nov 18, 2025 | ||
| 2025-06-25 | 2.11 |
2
| Jun 25, 2025 | ||
| Show 14 more from .x | |||||