The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to
computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying Eilenberg–Zilber
theorem, using the ACL2 theorem prover. As our formalization is executable, we are able to compare the results of the
certified programme with those of Kenzo on some universal examples. Since the results coincide, the reliability of Kenzo is
reinforced. This is a new step in our long-term project towards certified programming for Algebraic Topology.Ministerio de Ciencia e Innovación MTM2009-13842European Union’s 7th Framework Programme [243847] (ForMath)
