Metraipolis › archive › dc_e1aea5969f73

Developing a Numerical Algorithm with CIVL Model Checking in the Loop — arXiv:2609.31964

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31964
License (as archived)
CC0-1.0
Archived
2026-10-08T00:42:59.409Z
SHA-256 of the archived text
d30780b7470127a26bd478d98bc3f5cd92a1553eaebb039d67bbeb94124e80fb
Stable URL of this page
https://metraipolis.com/documento/dc_e1aea5969f73

How to cite

Developing a Numerical Algorithm with CIVL Model Checking in the Loop — arXiv:2609.31964 — arXiv (en), https://arxiv.org/abs/2609.31964 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e1aea5969f73 (Metraipolis archive dc_e1aea5969f73, sha256 d30780b7470127a26bd478d98bc3f5cd92a1553eaebb039d67bbeb94124e80fb)
BibTeX
@misc{dce1aea5969f73,
  title = {Developing a Numerical Algorithm with CIVL Model Checking in the Loop — arXiv:2609.31964},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31964},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e1aea5969f73; sha256 d30780b7470127a26bd478d98bc3f5cd92a1553eaebb039d67bbeb94124e80fb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31964. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Verifying a numerical algorithm in a large scientific simulation framework is challenging: the framework is too big to model-check, and the unit tests exercise only sampled inputs. We report a case study in which we developed a new cloud-in-cell (CIC) deposition algorithm for Flash-X, a large-scale multiphysics simulation framework, keeping the CIVL model checker in the development loop. Rather than verify the algorithm within Flash-X's hefty infrastructure, we extract only the interfaces that the algorithm needs into a small, self-contained C model, which abstracts away implementation details of the Flash-X infrastructure that are unrelated to the new algorithm. The new algorithm is then built and checked within this C model. The CIVL model checker enables verification of the required physical properties of the CIC deposition algorithm using symbolic values for the particle positions. It proves two physical properties---mass conservation and the deposition location---for the continuum of admissible positions in the simulation domain. CIVL also verifies the algorithm's memory safety and freedom from MPI deadlocks and data race conditions over all rank distributions within specified bounds. Writing the verifying properties first and continuously checking them at each stage of the bottom-up prototyping workflow turned CIVL into a design guardrail that greatly increased confidence in the extended algorithm. During our case study, CIVL surfaced a concurrency defect in the algorithm that our random-seed-based tests failed to exercise. This paper shows our workflow, with the goal of helping readers understand its benefits, cost, and tradeoffs compared with testing.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Computational Physics (physics.comp-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.31964 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T00:17:09.489Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).