🤖 AI Summary
This study addresses the challenge of formally verifying satisfiability decision algorithms for systems of inequalities by presenting a rigorous formal specification and verification of the Omega test using the Dafny programming language. The research defines executable representations and semantic models for rational numbers and linear constraints, integrating formal methods with theorem proving techniques to achieve fully automated verification of the algorithm's core logic. This work not only ensures the logical correctness and trustworthiness of the Omega test but also reveals novel insights into the algorithm through the rigorous formalization process. Ultimately, it establishes a reliable methodological foundation for constructing verifiable decision procedures in linear integer arithmetic.
📝 Abstract
We present a formalization in Dafny of the Omega Test, an algorithm used to decide the satisfiability of a system of inequalities. The implementation defines executable representations for rational numbers, linear expressions, inequalities, equalities, divisibility constraints, and systems of constraints, together with their semantic interpretation through valuations. We fully specify and verify the implementation in Dafny. We describe the lessons learned and how the formalization process led to new insights into the algorithm.