Bounded Verification of Sparse Matrix Computations

Tristan Dyer, Alper Altuntas, John Baugh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We show how to model and reason about the structure and behavior of sparse matrices, which are central to many applications in scientific computation. Our approach is state-based, relying on a formalism called Alloy to show that one model is a refinement of another. We present examples of sparse matrix-vector multiplication, transpose, and translation between formats using ELLPACK and compressed sparse row formats to demonstrate the approach. To model matrix computations in a declarative language like Alloy, a new idiom is presented for bounded iteration with incremental updates. Mechanical verification is performed using SAT solvers built into the tool.

Original languageEnglish
Title of host publicationProceedings of Correctness 2019
Subtitle of host publication3rd International Workshop on Software Correctness for HPC Applications - Held in conjunction with SC 2019: The International Conference for High Performance Computing, Networking, Storage and Analysis
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages36-43
Number of pages8
ISBN (Electronic)9781728160153
DOIs
StatePublished - Nov 2019
Event3rd IEEE/ACM International Workshop on Software Correctness for HPC Applications, Correctness 2019 - Denver, United States
Duration: Nov 18 2019 → …

Publication series

NameProceedings of Correctness 2019: 3rd International Workshop on Software Correctness for HPC Applications - Held in conjunction with SC 2019: The International Conference for High Performance Computing, Networking, Storage and Analysis

Conference

Conference3rd IEEE/ACM International Workshop on Software Correctness for HPC Applications, Correctness 2019
Country/TerritoryUnited States
CityDenver
Period11/18/19 → …

Keywords

  • mechanical verification
  • sparse matrix formats
  • state-based formal methods

Fingerprint

Dive into the research topics of 'Bounded Verification of Sparse Matrix Computations'. Together they form a unique fingerprint.

Cite this