Email Gateway (Aug 22 2022 at 18:06): Email Gateway (Aug 22 2022 at 18:06):From: Gerwin Klein <kleing@unsw.edu.au>
An Incremental Simplex Algorithm with Unsatisfiable Core Generation
by Filip Marić, Mirko Spasić and René Thiemann
We present an Isabelle/HOL formalization and total correctness proof for the incremental version of the Simplex algorithm which is used in most state-of-the-art SMT solvers. It supports extraction of satisfying assignments, extraction of unsatisfiable cores, incremental assertion of constraints and backtracking. Formalization relies on stepwise program refinement, starting from a simple specification, going through a number of refinement steps, and ending up in a fully executable functional implementation. Symmetries present in the algorithm are handled with special care.
https://www.isa-afp.org/entries/Simplex.html
Enjoy!
Gerwin
Last updated: Apr 25 2024 at 20:15 UTC