Computer Science > Software Engineering
Title:Formally Verified Semidefinite Programming
Abstract:We present a formally verified Rust implementation of a first-order semidefinite programming solver, a nontrivial piece of numerical software. We wrote the solver by hand and then directed Claude to generate the entire verification in Verus, an automated theorem prover for Rust programs. We discuss the algorithm underlying the solver, its implementation in Rust, and our pragmatic approach to proving it correct in Verus.
| Comments: | 9 pages. Comments welcome |
|---|---|
| Subjects: | Software Engineering (cs.SE) ; Logic in Computer Science (cs.LO); Optimization and Control (math.OC) |
| Cite as: | arXiv:2611.25174 [cs.SE] |
| (or arXiv:2611.25174v1 [cs.SE] for this version) | |
| https://doi.org/10.48550/arXiv.2611.25174 arXiv-issued DOI via DataCite (pending registration) |
Submission history
Access Paper:
- HTML (experimental)
Additional Features
- Audio Summary
Current browse context:
References & Citations
- Google Scholar
- Semantic Scholar
BibTeX formatted citation
Bookmark
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.