Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Class Notes for CS 819A3 -Spring 2003 4. Procedures
 

Summary: 81
Class Notes for CS 819A3 - Spring 2003
4. Procedures
John C. Reynolds
Department of Computer Science
Carnegie Mellon University
Revised February 25
c
2003 John C. Reynolds

82
Inference for Simple Nonrecursive Procedures
A simple procedure de nition has the form
h(x 1 ;    ; xm ; y 1 ;    ; y n ) = c;
where y 1 ;    ; y n are the distinct free variables assigned by the
command c, and x 1 ;    ; xm are the distinct free variables not
assigned by c.
If one can prove the speci cation fpg c fqg; then one can assume
the speci cation fpg h(x 1 ;    ; xm ; y 1 ;    ; y n ) fqg in proving a
speci cation of commands (other than c) that contains calls of

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics