uuverifiers / princess   2023-06-19


The Princess Theorem Prover

Scala versions: 2.13 2.12 2.11

The Princess Theorem Prover

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic with uninterpreted predicates, written entirely in Scala. Princess can reason about problems in integer arithmetic, augmented with predicates that can be axiomatised arbitrarily. Such problems can contain arbitrary quantifiers to express that some formula is supposed to hold for all or for some integers. Princess also contains theory modules for, among others, non-linear arithmetic, rationals, bit-vectors, arrays, heaps, algebraic data-types, strings.

More information about Princess can be found on the main webpage, https://philipp.ruemmer.org/princess.shtml