Download princess-smt-parser_2.12 JAR file with all dependencies
princess-smt-parser_2.12 from group io.github.uuverifiers (version 2021-06-28)
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
0 downloads
Artifact princess-smt-parser_2.12
Group io.github.uuverifiers
Version 2021-06-28
Last update 28. June 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
Group io.github.uuverifiers
Version 2021-06-28
Last update 28. June 2021
Tags: prover princess solver arithmetic predicates uninterpreted other presburger theorem theories various
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!
Page 1 from 1 (items total 1)