Partial correctness of a Fibonacci algorithm
From MaRDI portal
Publication:2113835
DOI10.2478/FORMA-2020-0016OpenAlexW3143907783MaRDI QIDQ2113835FDOQ2113835
Publication date: 14 March 2022
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/forma-2020-0016
Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) 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
- Partial correctness of GCD algorithm
- Partial correctness of a factorial algorithm
- Partial correctness of a power algorithm
Cited In (1)
Uses Software
This page was built for publication: Partial correctness of a Fibonacci algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113835)
