| TR#: | CS0395 |
| Class: | CS |
| Title: | On the Equivalence of Weak Second Order and Non-Standard Time Semantics for Various Program Verification Systems |
| Authors: | J.A. Makowsky and I. Sain |
| CS0395.pdf | |
| Abstract: | We show how to derive Leivant s characterization of Floyd-Hoare Logic in weak second order logic ([LB5]) directly from Csirmaz's characterization of Floyd-Hoare logic in Nonstandard Logics of Programs ([Cs80]). Our method allows us to spell out the precise role of the comprehension axiom in weak second order logic. We then prove similar results for other program verification systems (suggested by Burstall and Pnueli) and identify exactly the comprehension axioms corresponding to those systems. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0395), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page