This is a part of GSOC in Scala:

• http://www.scala-lang.org/gsoc2013

The goal of this project is to develop a reasonably efficient constraint solver in Scala. You will build on a SAT solver we are developing and will add incremental SAT solving capabilities as well as reasoning about functional data structures. The constraint solver can be used for constraint programming, automated testing, verification, and synthesis in Scala.

The following report describes the SAT solver:

• https://infoscience.epfl.ch/record/186129

The solver is open source and available on GitHub:

• https://github.com/regb/scabolic

Constraints solvers are fast theorem provers for certain classes of constraints, including propositional logic, theories of algebraic data types, integer arithmetic, arrays, and other theories of interest. Many great tools currently use off-the-shelf SMT solvers. Having a solver fully in Scala would open up further possibilities for integration and optimizations at the boundary between the solver and the system that uses it. It would also simplify the deployment of such tools.

• Regis Blanc
• Philippe Suter
• Viktor Kuncak

• Constraint Solver in Scala that Includes Simplex Solver

• LARA Software
• http://www.verit-solver.org/

• Chaff: engineering an efficient SAT solver
• Efficient conflict driven learning in a boolean satisfiability solver
• An Extensible SAT-solver (original MiniSat implementation description)

• DPLL(T): Fast Decision Procedures
• Theorem Proving using Lazy Proof Explication and the corresponding Slides on Lazy Proof Explication
• Integrating Simplex with DPLL(T) and Longer Report on Integrating Simplex with DPLL(T)
• Model-Based Theory Combination
• Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
• An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types

• KodKod paper
• Paradox paper
• Bounded Model Generation for Isabelle/HOL
• Calculi for Program Incorrectness and Arithmetic, Philipp Rümmer's PhD thesis