Specifying and Proving a Sorting Algorithm - Archive ouverte HAL Accéder directement au contenu
Autre Publication Scientifique Année : 2009

Specifying and Proving a Sorting Algorithm

Résumé

This work investigates the question of automaticity of algorithm proofs, through the typical example of a sorting algorithm. The first part introduces two specification languages for Java programs. In the second part one of them is used to specify a sorting algorithm by selection. The suggested specifications are enhanced until obtaining a complete solution by the current automated theorem provers. This report is a part of Elena Tushkanova's diploma project (equivalent to a master thesis) entitled “Modular Specification of Object Oriented Programs” from the Yaroslavl State University, Russia, translated from Russian into English.
Fichier principal
Vignette du fichier
RR2009-03.pdf (616.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00429040 , version 1 (30-10-2009)

Identifiants

  • HAL Id : hal-00429040 , version 1

Citer

Elena Tushkanova, Alain Giorgetti, Olga Kouchnarenko. Specifying and Proving a Sorting Algorithm. 2009. ⟨hal-00429040⟩
164 Consultations
1381 Téléchargements

Partager

Gmail Facebook X LinkedIn More