Verifying a Sparse Matrix Algorithm Using Symbolic Execution

Scientific software is, by its very nature, complex.It is mathematical and highly optimized which makes it prone to subtle bugs not as easily detected by traditional testing.We outline how symbolic execution can be used to write tests similar to traditional unit tests while providing stronger verification guarantees and apply this methodology to a sparse matrix algorithm.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2025-10-14
DOI
https://doi.org/10.4204/eptcs.432.5
Primary Topic
Embedded Systems Design Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Verifying a Sparse Matrix Algorithm Using Symbolic Execution

Alexander C. Wilton
Electronic Proceedings in Theoretical Computer Science
Embedded Systems Design Techniques
article

Verifying a Sparse Matrix Algorithm Using Symbolic Execution

Alexander C. Wilton
article en

Abstract

Scientific software is, by its very nature, complex.It is mathematical and highly optimized which makes it prone to subtle bugs not as easily detected by traditional testing.We outline how symbolic execution can be used to write tests similar to traditional unit tests while providing stronger verification guarantees and apply this methodology to a sparse matrix algorithm.

Electronic Proceedings in Theoretical Computer ScienceVol. 432
University of Delaware (US)
National Science Foundation
Openalex Percentile: Top 68%
Embedded Systems Design Techniques
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Verifying a Sparse Matrix Algorithm Using Symbolic Execution — Alexander C. Wilton · Electronic Proceedings in Theoretical Computer Science (2025) | TGRS Research Map | TGRS