Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper)
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909847593680896 |
|---|---|
| author | Appel, Andrew W. |
| author_facet | Appel, Andrew W. |
| contents | We describe a machine-checked correctness proof of a C program that converts a coordinate-form (COO) sparse matrix to a compressed-sparse-row (CSR) matrix. The classic algorithm (sort the COO entries in lexicographic order by row,column; fill in the CSR arrays left to right) is concise but has rather intricate invariants. We illustrate a bottom-up methodology for deriving the invariants from the program. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_13412 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper) Appel, Andrew W. Numerical Analysis Logic in Computer Science F.3.1; F.2.2; G.1.3 We describe a machine-checked correctness proof of a C program that converts a coordinate-form (COO) sparse matrix to a compressed-sparse-row (CSR) matrix. The classic algorithm (sort the COO entries in lexicographic order by row,column; fill in the CSR arrays left to right) is concise but has rather intricate invariants. We illustrate a bottom-up methodology for deriving the invariants from the program. |
| title | Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper) |
| topic | Numerical Analysis Logic in Computer Science F.3.1; F.2.2; G.1.3 |
| url | https://arxiv.org/abs/2510.13412 |