This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Use of Higher Order Logic in Program Verification
August 1976 (vol. 25 no. 8)
pp. 844-851
G.W. Ernst, Department of Computer Engineering, Case Western Reserve University
This paper focuses on the interface between program verification and mechanical theorem proving. It is often much easier to express what a program does in higher order logic than in first-order logic. However, in general, higher order theorem proving is difficult to mechanize. Hence we have isolated some special classes of higher order formulas and will show how they can be processed efficiently by a computer. Examples are given that illustrate how naturally these formulas arise in program verification.
Index Terms:
Heuristic search, higher order logic, inductive assertions, mechanical theorem proving, program verification.
Citation:
G.W. Ernst, R.J. Hookway, "The Use of Higher Order Logic in Program Verification," IEEE Transactions on Computers, vol. 25, no. 8, pp. 844-851, Aug. 1976, doi:10.1109/TC.1976.1674703
Usage of this product signifies your acceptance of the Terms of Use.