A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A formal proof of Sasaki-Murao algorithm
2013
Journal of Formalized Reasoning
Preserved Fulltext
The Sasaki-Murao algorithm computes the determinant of any square matrix over a commutative ring in polynomial time. The algorithm itself can be written as a short and simple functional program, but its correctness involves non-trivial mathematics. We here represent this algorithm in Type Theory with a new correctness proof, using the Coq proof assistant and the SSReflect extension.
doi:10.6092/issn.1972-5787/2615
dblp:journals/jfrea/CoquandMS12
fatcat:ehb4tjpy5fbdlnventv2t52d24