A correctness proof of sorting by means of formal procedures

DOI10.1016/0167-6423(87)90009-8zbMATH Open0633.68006OpenAlexW1980558980MaRDI QIDQ1096378

Maarten M. Fokkinga

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-correctness-proof-of-sorting-by-means-of-formal-procedures(ea0b04e5-f6cf-422c-a28a-dcbcccde4438).html

zbMATH Keywords

functional programHoare-style pre- and postassertionsrecursive sorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

A First Class Boolean Sort in First-Order Theorem Proving and TPTP ⋮ Title not available (Why is that?)

This page was built for publication: A correctness proof of sorting by means of formal procedures

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