Location of Repository

Relative completeness of a Hoare-calculus for while-programs

By Kurt Sieber


In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi have been studied. The purpose of this paper is to present a simple approach to this subject by restricting the attention to a very small class of programs, the so-called while-programs

Topics: Data processing Computer science
Publisher: Fakultät 6 - Naturwissenschaftlich-Technische Fakultät I. Fachrichtung 6.2 - Informatik
Year: 1980
OAI identifier: oai:scidok.sulb.uni-saarland.de:4027

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.