A formal method for developing algebraic and numerical algorithms

DOI10.19823/J.CNKI.1007-1202.2021.0019MaRDI QIDQ5153485zbMATH OpenFDO

Authors

Publication date 29 September 2021

Full work available at URL https://doi.org/10.19823/J.CNKI.1007-1202.2021.0019

zbMATH Keywords

algebraicl algorithmsformal methodmathematical inductionnumerical algorithmspartitionrecursion

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of algorithms (68W01) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 5139236
• A refinement-based approach to computational algebra in Coq
• The formal derivation of algorithm and automatic verification based on Isabelle
• Combining algebraic specifications and procedural tools for correct program development
• scientific article; zbMATH DE number 3954252

Cited in

(7)

• scientific article; zbMATH DE number 5139236 (Why is no real title available?)
• Formal Techniques for Deriving Binary Search Algorithms
• scientific article; zbMATH DE number 1528724 (Why is no real title available?)
• The formal derivation of algorithm and automatic verification based on Isabelle
• scientific article; zbMATH DE number 1860657 (Why is no real title available?)
• scientific article; zbMATH DE number 844104 (Why is no real title available?)
• Formal derivation of algorithms

This page was built for publication: A formal method for developing algebraic and numerical algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153485)