Verified Textbook Algorithms

DOI10.1007/978-3-030-59152-6_2MaRDI QIDQ6485853zbMATH OpenFDO

Authors Tobias Nipkow, Manuel Eberl, Maximilian P. L. Haslbeck

Publication date 22 December 2022

Published in 1517.68443 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59152-6_2

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68Wxx) Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Certifying algorithms
• Program verification: state of the art, problems, and results. II
• Program verification: state of the art, problems, and results. I
• Verified analysis of list update algorithms
• scientific article; zbMATH DE number 1200109

Cited in

(2)

• Simplified and verified: a second look at a proof-producing union-find algorithm
• Formally verified suffix array construction

This page was built for publication: Verified Textbook Algorithms

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