princess_2.13
io.github.uuverifiers
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Recommended: 2026-05-20 17 versions jar Updated 1 year ago BSD-3-ClauseChecking...
Add to your project2022-11-03
<dependency>
<groupId>io.github.uuverifiers</groupId>
<artifactId>princess_2.13</artifactId>
<version>2022-11-03</version>
</dependency>Version Details — 2022-11-03
Packaging
jar
Direct Deps
0
Total Deps
0
Published
Nov 4, 2022
License
BSD-3-Clause
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Checking security advisories...