Cargando…
A Formalization of the Smith Normal Form in Higher-Order Logic
This work presents formal correctness proofs in Isabelle/HOL of algorithms to transform a matrix into Smith normal form, a canonical matrix form, in a general setting: the algorithms are written in an abstract form and parameterized by very few simple operations. We formally show their soundness pro...
Autores principales: | Divasón, Jose, Thiemann, René |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Netherlands
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9637085/ https://www.ncbi.nlm.nih.gov/pubmed/36353683 http://dx.doi.org/10.1007/s10817-022-09631-5 |
Ejemplares similares
-
Combining Higher-Order Logic with Set Theory Formalizations
por: Kaliszyk, Cezary, et al.
Publicado: (2023) -
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL
por: Thiemann, René, et al.
Publicado: (2020) -
A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm
por: Divasón, Jose, et al.
Publicado: (2019) -
Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting
por: Lochmann, Alexander, et al.
Publicado: (2020) -
Formal logic
por: Prior, A. N. (Arthur N.), 1914-1969
Publicado: (1962)