OptiRica: Towards an Efficient Optimizing Horn Solver

Hossein Hojjat
Philipp Rümmer

This paper describes an ongoing effort to develop an optimizing version of the Eldarica Horn solver. The work starts from the observation that many kinds of optimization problems, and in particular the MaxSAT/SMT problem, can be seen as search problems on lattices. The paper presents a Scala library providing a domain-specific language (DSL) to uniformly model optimization problems of this kind, by defining, manipulating, and systematically exploring lattices with associated objective functions. The framework can be instantiated to obtain an optimizing Horn solver. As an illustration, the application of an optimizing solver for repairing software-defined networks is described.

In Geoffrey W. Hamilton, Temesghen Kahsai and Maurizio Proietti: Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation (HCVS/VPT 2022), Munich, Germany, 3rd April 2022, Electronic Proceedings in Theoretical Computer Science 373, pp. 35–43.
Published: 22nd November 2022.

ArXived at: https://dx.doi.org/10.4204/EPTCS.373.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org