Partial correctness of a power algorithm
From MaRDI portal
Publication:2337338
DOI10.2478/forma-2019-0018zbMath1432.68535OpenAlexW2964266122WikidataQ127453021 ScholiaQ127453021MaRDI QIDQ2337338
Publication date: 19 November 2019
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/forma-2019-0018
Specification and verification (program logics, model checking, etc.) (68Q60) Formalization of mathematics in connection with theorem provers (68V20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Four decades of {\textsc{Mizar}}. Foreword
- Proving properties of programs on hierarchical nominative data
- Implementation of the composition-nominative approach to program formalization in Mizar
- The role of the Mizar mathematical library for interactive proof development in Mizar
- Simple-named complex-valued nominative data -- definition and basic operations
- Kleene algebra of partial predicates
- On algebras of algorithms and specifications over uninterpreted data
- On an algorithmic algebra over simple-named complex-valued nominative data
- An inference system of an extension of Floyd-Hoare logic for partial predicates
- Partial correctness of GCD algorithm
- An axiomatic basis for computer programming
This page was built for publication: Partial correctness of a power algorithm
