A simple algorithm with no simple verification

TitleA simple algorithm with no simple verification
Publication TypeJournal Article
AuthorsCsirmaz, L.
Year2007
Abstract

The correctness of a simple sorting algorithm is presented, which algorithm is "evidently wrong" at the first sight. It is conjectured that the algorithm has no straightforward, transparent verification. The paper is a nice example for the usage of the Floyd-Hoare-Naur verification method.

Languageeng
Notes

exported from refbase (http://www.bibliography.ceu.hu/show.php?record=20), last updated on Tue, 19 May 2009 11:40:47 +0200

Publisher linkhttp://www.renyi.hu/~csirmaz/simple.pdf
Unit: 
Department of Mathematics and its Applications