A correctness proof of sorting by means of formal procedures (Q1096378)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A correctness proof of sorting by means of formal procedures |
scientific article; zbMATH DE number 4030951
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A correctness proof of sorting by means of formal procedures |
scientific article; zbMATH DE number 4030951 |
Statements
A correctness proof of sorting by means of formal procedures (English)
0 references
1987
0 references
We consider a recursive sorting algorithm in which, in each invocation, a new variable and a new procedure (using the variable globally) are defined and the procedure is passed to recursive calls. This algorithm is proved correct with Hoare-style pre- and postassertions. We also discuss the same algorithm expressed as a functional program.
0 references
recursive sorting algorithm
0 references
Hoare-style pre- and postassertions
0 references
functional program
0 references
0.7679018974304199
0 references
0.7642563581466675
0 references