PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Aiello L., Aiello M., Weyhrauch R. W. PASCAL in LCF : semantics and examples of proofs. In: Theoretical Computer Science, vol. 5 pp. 135 - 177. North Holland, 1977.
 
 
Abstract
(English)
An axiomatization in LCF of a substantial subset of PASCAL (including I/O) is presented. The syntax of such a subset is introduced and the LCF axioms defining the corresponding semantics are discussed. Sample theorems about the semantic definitions are shown. As an example of use of this axiomatization for proving properties of programs (with a machine checked proof), we present the correctness of a program for the "McCarthy Airline" reservation system. An interesting aspect of such a program is that it deals with a potentially infinite sequence of inputs. An LCF theorem asserting its (partial) correctness is then presented, with its proof, carried out using the Stanford LCF proof checker.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional