At a Glance
| Applications | SAT Solver SMT Solver Theorem Prover |
| Developers | Uppsala University |
| Inputs | WhyML |
| Interfaces | CLI Why3 |
| Licenses | MIT |
| Maintenance | Actively Maintained |
Description
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic with uninterpreted predicates, written entirely in Scala.