Download PDFOpen PDF in browserExtending a Verified Simplex Algorithm12 pages•Published: November 18, 2018AbstractAs 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 ́c and Mari ́c. We further discuss the impact of their design decisions on the development of our extension.Keyphrases: dpll(t), isabelle/hol, linear rational arithmetic, theory solver, unsatisfiable core In: Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22 Workshop and Short Paper Proceedings, vol 9, pages 37-48.
|