Abstract

We formalize the theory of homogeneous linear diophantine equations, focusing on two main results: (1) an abstract characterization of minimal complete sets of solutions, and (2) an algorithm computing them. Both, the characterization and the algorithm are based on previous work by Huet. Our starting point is a simple but inefficient variant of Huet's lexicographic algorithm incorporating improved bounds due to Clausen and Fortenbacher. We proceed by proving its soundness and completeness. Finally, we employ code equations to obtain a reasonably efficient implementation. Thus, we provide a formally verified solver for homogeneous linear diophantine equations.

BibTeX

@article{FMJPJSCS-AFP17,
  author  = {Florian Meßner and Julian Parsert and Jonas Schöpf and Christian Sternagel},
  title   = {Homogeneous Linear Diophantine Equations},
  journal = {Archive of Formal Proofs},
  month   = oct,
  year    = 2017,
  note    = {\url{https://www.isa-afp.org/entries/Diophantine_Eqns_Lin_Hom.html},
            Formal proof development},
  ISSN    = {2150-914x},
}