versions

Author: pruemmer

README.md

@@ -1,4 +1,14 @@
 # The Princess Theorem Prover
 
+Princess is a theorem prover (aka SMT Solver) for Presburger
+arithmetic with uninterpreted predicates, written entirely in <a
+href="http://www.scala-lang.org/">Scala</a>.  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

build.sbt

@@ -2,7 +2,7 @@
 lazy val commonSettings = Seq(
     name                 := "Princess",
     organization         := "uuverifiers",
-    version              := "2022-11-03",
+    version              := "2023-04-07",
     homepage             := Some(url("https://philipp.ruemmer.org/princess.shtml")),
     licenses             := Seq("BSD-3-Clause" -> url("https://opensource.org/licenses/BSD-3-Clause")),
     scmInfo              := Some(ScmInfo(
@@ -38,6 +38,12 @@ lazy val commonSettings = Seq(
                                 name  = "Peter Baumgartner",
                                 email = "[email protected]",
                                 url   = url("http://users.cecs.anu.edu.au/~baumgart/")
+                              ),
+                              Developer(
+                                id    = "amanda.stjerna",
+                                name  = "Amanda Stjerna",
+                                email = "[email protected]",
+                                url   = url("https://amandastjerna.se/")
                               )
                             ),
     description          := "Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.",

src/ap/CmdlMain.scala

@@ -50,7 +50,7 @@ import ap.util.{Debug, Seqs, Timeout}
 
 object CmdlMain {
 
-  val version = "2022-11-03"
+  val version = "2023-04-07"
 
   /**
    * Flag to enable stack traces being fully printed, for problems
@@ -69,9 +69,9 @@ object CmdlMain {
     println("(" + version + ")")
     println
     println("(c) Philipp Rümmer, 2009-2023")
-    println("Contributors: Angelo Brillout, Peter Backeman, Peter Baumgartner, Zafer Esen.")
+    println("Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,")
+    println("              Amanda Stjerna.")
     println("Free software under BSD-3-Clause.")
-    println("Bug reports to [email protected]")
     println
     println("For more information, visit http://www.philipp.ruemmer.org/princess.shtml")
   }