Download princess_2.11 JAR file with all dependencies
princess_2.11 from group io.github.uuverifiers (version 2022-11-03)
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Artifact princess_2.11
Group io.github.uuverifiers
Version 2022-11-03
Last update 04. November 2022
Tags: theorem predicates other uninterpreted various theories arithmetic princess presburger prover solver
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 5
Dependencies scala-library, princess-parser_2.11, princess-smt-parser_2.11, scala-parser-combinators_2.11, java-cup,
There are maybe transitive dependencies!
Group io.github.uuverifiers
Version 2022-11-03
Last update 04. November 2022
Tags: theorem predicates other uninterpreted various theories arithmetic princess presburger prover solver
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 5
Dependencies scala-library, princess-parser_2.11, princess-smt-parser_2.11, scala-parser-combinators_2.11, java-cup,
There are maybe transitive dependencies!
Page 1 from 1 (items total 1)