Partial correctness of a factorial algorithm
From MaRDI portal
Publication:2337337
DOI10.2478/FORMA-2019-0017zbMATH Open1432.68536OpenAlexW2963647469WikidataQ127494107 ScholiaQ127494107MaRDI QIDQ2337337FDOQ2337337
Authors: Adrian Jaszczak, Artur Korniłowicz 
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-0017
Recommendations
- Partial correctness of a Fibonacci algorithm
- Partial correctness of GCD algorithm
- Partial correctness of a power algorithm
- An improved computational algorithm for finding the factorial
- On the complexity of calculating factorials
- scientific article; zbMATH DE number 991430
- scientific article; zbMATH DE number 1046599
- scientific article; zbMATH DE number 3926528
- scientific article; zbMATH DE number 1962810
Specification and verification (program logics, model checking, etc.) (68Q60) Formalization of mathematics in connection with theorem provers (68V20)
Cites Work
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Implementation of the composition-nominative approach to program formalization in Mizar
- Four decades of \textsc{Mizar}. Foreword
- Proving properties of programs on hierarchical nominative data
- Kleene algebra of partial predicates
- The role of the Mizar mathematical library for interactive proof development in Mizar
- Simple-named complex-valued nominative data -- definition and basic operations
- On an algorithmic algebra over simple-named complex-valued nominative data
- On algebras of algorithms and specifications over uninterpreted data
- An inference system of an extension of Floyd-Hoare logic for partial predicates
Cited In (5)
Uses Software
This page was built for publication: Partial correctness of a factorial algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337337)
