Partial correctness of a factorial algorithm
From MaRDI portal
(Redirected from Publication:2337337)
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
Cites work
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- An axiomatic basis for computer programming
- An inference system of an extension of Floyd-Hoare logic for partial predicates
- Four decades of \textsc{Mizar}. Foreword
- Implementation of the composition-nominative approach to program formalization in Mizar
- 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
- Proving properties of programs on hierarchical nominative data
- Simple-named complex-valued nominative data -- definition and basic operations
- The role of the Mizar mathematical library for interactive proof development in Mizar
Cited in
(5)
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)
