Formal Verification of a Generic Iterative Algorithm
Formalized Mathematics · 01.06.2026 · 34 (1) · 57-71
DOI: 10.2478/forma-2026-0005 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formalized Mathematics, online erschienen am 18.11.2026. Verfasst von Artur Korniłowicz. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).
Abstract (Originalsprache)
In this paper we formally verify in the Mizar system the correctness of a parameterized algorithm using SCM (Simple Concrete Model). Generic properties of the algorithm are formulated and proved as Mizar schemes. In the last section, two classical cases are verified: the computation of the factorial of a natural number and the computation of the n -th triangular number.
Zitieren
APA
Korniłowicz, A. (2026). Formal Verification of a Generic Iterative Algorithm. Formalized Mathematics, 34(1), 57-71. https://doi.org/10.2478/forma-2026-0005
Vancouver
Korniłowicz A. Formal Verification of a Generic Iterative Algorithm. Formalized Mathematics. 2026;34(1):57-71. doi:10.2478/forma-2026-0005
BibTeX
@article{Korniowicz2026,
author = {Korniłowicz, Artur},
title = {Formal Verification of a Generic Iterative Algorithm},
journal = {Formalized Mathematics},
year = {2026},
volume = {34},
number = {1},
pages = {57--71},
doi = {10.2478/forma-2026-0005}
}
EUVIMED