Partial Correctness of a Power Algorithm
This work continues a formal verification of algorithms written in terms of simple-named complex-valued nominative data [6],[8],[15],[11],[12],[13]. In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of the algorithm:
Main Author: | Jaszczak Adrian |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2019-07-01
|
Series: | Formalized Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.2478/forma-2019-0018 |
Similar Items
-
Partial Correctness of a Factorial Algorithm
by: Jaszczak Adrian, et al.
Published: (2019-07-01) -
Partial Correctness of GCD Algorithm
by: Ivanov Ievgen, et al.
Published: (2018-07-01) -
Partial Correctness of an Algorithm Computing Lucas Sequences
by: Jaszczak Adrian
Published: (2020-12-01) -
Partial Correctness of a Fibonacci Algorithm
by: Korniłowicz Artur
Published: (2020-07-01) -
General Theory and Tools for Proving Algorithms in Nominative Data Systems
by: Jaszczak Adrian
Published: (2020-12-01)