Download JAR files tagged by princess with all dependencies

princess_2.13 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess_2.13
Show all versions Show documentation Show source

0 downloads

Artifact princess_2.13
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 5
Dependencies scala-library, princess-parser_2.13, princess-smt-parser_2.13, scala-parser-combinators_2.13, java-cup,
There are maybe transitive dependencies!

princess-parser_2.13 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess-parser_2.13
Show all versions Show documentation Show source

0 downloads

Artifact princess-parser_2.13
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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!

princess-smt-parser_2.13 from group io.github.uuverifiers (version 2024-11-08)

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

0 downloads

Artifact princess-smt-parser_2.13
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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!

princess_2.12 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess_2.12
Show all versions Show documentation Show source

0 downloads

Artifact princess_2.12
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 5
Dependencies scala-library, princess-parser_2.12, princess-smt-parser_2.12, scala-parser-combinators_2.12, java-cup,
There are maybe transitive dependencies!

princess-parser_2.12 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess-parser_2.12
Show all versions Show documentation Show source

0 downloads

Artifact princess-parser_2.12
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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!

princess-smt-parser_2.12 from group io.github.uuverifiers (version 2024-11-08)

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.12
Show all versions Show documentation Show source

0 downloads

Artifact princess-smt-parser_2.12
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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!

princess_2.11 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess_2.11
Show all versions Show documentation Show source

0 downloads

Artifact princess_2.11
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 2024
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!

princess-parser_2.11 from group io.github.uuverifiers (version 2024-11-08)

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

Group: io.github.uuverifiers Artifact: princess-parser_2.11
Show all versions Show documentation Show source

0 downloads

Artifact princess-parser_2.11
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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!

princess-smt-parser_2.11 from group io.github.uuverifiers (version 2024-11-08)

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.11
Show all versions Show documentation Show source

0 downloads

Artifact princess-smt-parser_2.11
Group io.github.uuverifiers
Version 2024-11-08
Last update 08. November 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 9)