Solver Proxy

SATSolverProxy is a C++ Framework to easily switch between multiple SAT solver.

The following solver are currently supported:

• antom [1]
• CaDiCaL [2]
• Glucose 3 [3]
• Glucose 4.2.1 [3]
• CryptoMiniSAT 5.6.5 [4]

SATSolverProxy has served as the backend solver in several projects:

• Gay, Maël, Tobias Paxian, Upadhyaya, Devanshi, Bernd Becker and Ilia Polian. "Hardware-Oriented Algebraic Fault Attack Framework with Multiple Fault Injection Support." 2019 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE, 2019.
• Paxian, Tobias, Sven Reimer, and Bernd Becker. "Pacose: An Iterative SAT-based MaxSAT Solver." MaxSAT Evaluation 2018: 20.
• Raiola, Pascal, Tobias Paxian and Bernd Becker. "Minimal witnesses for security weaknesses in reconfigurable scan networks (submitted)

References:
[1] Schubert, Tobias, Matthew Lewis, and Bernd Becker. "Antom—solver description." SAT Race (2010).
[2] Biere, Armin. "CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition 2017." SAT competition 2017 (2017): 1.
[3] Audemard, Gilles, and Laurent Simon. "On the glucose sat solver." International Journal on Artificial Intelligence Tools 27.01 (2018): 1840001.
[4] Kochemazov, Stepan, et al. "MapleLCMDistChronoBT-DL, duplicate learnts heuristic-aided solvers at the SAT Race 2019." SAT RACE 2019: 24.

Contact:

M.Sc. Tobias Paxian
Institute of Computer Science
Faculty of Engineering
Albert-Ludwigs-University Freiburg
Georges-Koehler-Allee 051
Room: 01.030
D-79110 Freiburg im Breisgau
Germany
E-mail: paxiant@informatik.uni-freiburg.de
Phone: +49 761 203 8154