Download princess-smt-parser_2.13 JAR file with all dependencies
princess-smt-parser_2.13 from group io.github.uuverifiers (version 2024-03-22)
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.
Group: io.github.uuverifiers Artifact: princess-smt-parser_2.13
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact princess-smt-parser_2.13
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
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 2024-03-22
Last update 21. March 2024
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)