Verifying a Sparse Matrix Algorithm Using Symbolic Execution

October 15, 2025 Β· Declared Dead Β· πŸ› Electronic Proceedings in Theoretical Computer Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexander C. Wilton arXiv ID 2510.13424 Category cs.SE: Software Engineering Citations 0 Venue Electronic Proceedings in Theoretical Computer Science Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted