Author:
O’Hearn Peter W.,Tennent Robert D.
Reference28 articles.
1. Barringer, H., Cheng, J. H., and Jones, C. B. (1984). A logic covering undefinedness in program proofs. Acta Informatica, 21: 251–269.
2. Damm, W. and Josko, B. (1983). A sound and relatively*-complete Hoare-logic for a language with higher-type procedures. Acta Informatica, 20: 63–92.
3. German, S. M., Clarke, E. M., and Halpern, J. Y. (1989). Reasoning about procedures as parameters in the language L4. Information and Computation, 83: 265–359.
4. Goerdt, A. (1985). A Hoare calculus for functions defined by recursion on higher types. In (Parikh, 1985 ), pages 106–117.
5. Hoare, C. A. R. (1969). An axiomatic basis for computer programming. Comm. ACM, 12(10):576–580 and 583.