A Calculus for Higher Order Procedures with Global Variables (1993)
| Venue: | Proc., MFCS '93, Springer LNCS 711 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Stephan93acalculus,
author = {Werner Stephan and Andreas Wolpers},
title = {A Calculus for Higher Order Procedures with Global Variables},
booktitle = {Proc., MFCS '93, Springer LNCS 711},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. An arithmetically complete axiom system for full Algol-like higher order procedures with mode depth one is presented. To show soundness, a translation of the calculus into a variant of Dynamic Logic is defined. The completeness proof is outlined. 1 Introduction The treatment of higher-order procedures (procedures can be passed as parameters) in Hoare-like axiomatic systems has been a major research topic since the problem of sound and relatively complete calculi for `simple' procedures was solved in a satisfactory way, [Coo78], [Old81], [Apt81]. All known proof systems for higher-order procedures extend the basic formalism introduced by Hoare, [Hoa69], in a significant way. Olderog, [Old84], and Damm and Josko, [DJ83], extend the language for pre- and postconditions while the form of the partial correctness assertions is maintained. In contrast to that German, Clarke and Halpern, [GCH89], extend the expressiveness of the underlying logic adhering to a first-order language for pr...
Citations
| 1219 | An axiomatic basis for computer programming - Hoare - 1969 |
| 107 | Soundness and completeness of an axiom system for program verification - Cook - 1978 |
| 16 | W.: “A Dynamic Logic for Program Verification - Heisel, Reif, et al. - 1989 |
| 9 | The characterization problem for Hoare logics - Clarke - 1985 |
| 5 | Ten years of hoare logic: A survey---part 1 - Apt - 1981 |
| 3 | A sound and relatively ∗ complete axiomatization of Clarke’s language L4 - Damm, Josko - 1983 |
| 2 | Axiomatising the Logic of Computer Programming. Number 130 - Goldblatt - 1982 |
