Eprints of Rényi Institute

A simple algorithm with no simple verification

Csirmaz, László (1990) A simple algorithm with no simple verification. (Unpublished)



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.

Item Type:Research Paper
Keywords and phrases:program verification, sorting, formal proof
Subjects:03B70 Logic in computer science
68W40 Analysis of algorithms
68N17 Logic programming
Divisions:Research Groups > Theoretical cryptography
Last Modified:10 Jul 2009 17:07

Repository Staff Only: item control page