Extending a Verified Simplex Algorithm

Abstract

As an ingredient for a verified DPLL(T) solver, it is crucial to have a theory solver that has an incremental interface and provides unsatisfiable cores. To this end, we extend the Isabelle/HOL formalization of the simplex algorithm by Spasić and Marić. We further discuss the impact of their design decisions on the development of our extension.