Extending a Verified Simplex Algorithm

12 pages•Published: November 18, 2018

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 ́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.

Links:	https://easychair.org/publications/paper/6JF3
	https://doi.org/10.29007/5vlq

BibTeX entry

@inproceedings{LPAR-IWIL2018:Extending_Verified_Simplex_Algorithm,
  author    = {René Thiemann},
  title     = {Extending a Verified Simplex Algorithm},
  booktitle = {LPAR-22 Workshop and Short Paper Proceedings},
  editor    = {Gilles Barthe and Konstantin Korovin and Stephan Schulz and Martin Suda and Geoff Sutcliffe and Margus Veanes},
  series    = {Kalpa Publications in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/6JF3},
  doi       = {10.29007/5vlq},
  pages     = {37-48},
  year      = {2018}}

Download PDF Open PDF in browser