Home » io.github.uuverifiers » princess-parser » Badges

Princess Parser

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Generate a badge for this artifact.

Preview
Badge preview
Type:
Type:
Badges are served from badges.mvnrepository.com.