A correctness proof of sorting by means of formal procedures

Share/Save/Bookmark

Fokkinga, Maarten M. (1987) A correctness proof of sorting by means of formal procedures. Science of Computer Programming, 9 (3). pp. 263-269. ISSN 0167-6423

[img]
Preview
PDF
77Kb
Abstract: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.
Item Type:Article
Copyright:© 1987 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66237
Official URL:http://dx.doi.org/10.1016/0167-6423(87)90009-8
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page