Predicate transformers for recursive procedures with local variables

Formal Aspects of Computing

Volumn 11, Issue 6, 1999, Pages 616-636

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Frames; Predicate transformers; Proof rule; Recursive procedures

Indexed keywords

EID: 0042282213     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001659970002     Document Type: Article

References (19)

1. Abadi, M. and Leino, K.R.M.: A logic of object-oriented programs. SRC Research Report 161, 1998.
2. Back, R.J.R. and Butler, M.: Fusion and simultaneous execution in the refinement calculus. Acta Informatica 35 (1998) 921-949.
3. Back, R.J.R. and von Wright, J.: Duality in specification languages: a lattice-theoretical approach. Acta Informatica 27 (1990) 583-625.
4. Back, R.J.R. and von Wright, J.: Refinement Calculus. Graduate Texts in Computer Science, Springer V. 1998.
5. Chandra, A., Kozen, D. and Stockmeyer, L.: Alternation. Journal ACM 28 (1981) 114-133.
6. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall 1976.
7. Dijkstra, E.W. and van Gasteren, A.J.M.: A simple fixpoint argument without the restriction to continuity. Acta Informatica 23 (1986) 1-7.
8. Dijkstra, E.W. and Scholten, C.S.: Predicate Calculus and Program Semantics. Springer V. 1990.
9. Hesselink, W.H.: Modalities of nondeterminacy. In: W.H.J. Feijen et al. (eds.): Beauty is our business, a birthday salute to Edsger W. Dijkstra. Springer V. 1990, pp. 182-192.
10. Hesselink, W.H.: Programs, Recursion and Unbounded Choice, predicate transformation semantics and transformation rules. Cambridge University Press, 1992.
11. Hesselink, W.H.: Proof rules for recursive procedures. Formal Aspects of Computing 5 (1993) 554-570.
12. Hesselink, W.H.: Nondeterminacy and recursion via stacks and games. Theoretical Computer Science 124 (1994) 273-295.
13. Karp, R.M.: Some applications of logical syntax to digital computer programming. Thesis, Harvard University, 1959.
14. Mahony, B.P.: The least conjunctive refinement and promotion in the refinement calculus. Formal Aspects of Computing 11 (1999) 75-105.
15. Morgan, C. and Gardiner, P.H.B.: Data refinement by calculation. Acta Informatica 27 (1990) 481-503.
16. Nelson, G.: A generalization of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems, 11 (1989) 517-561.
17. Oles, F.J.: Type algebras, functor categories and block structure. In M. Nivat and J.C. Reynolds (eds.): Algebraic Methods in Semantics, pp. 543-573. Cambridge University Press, Cambridge, 1985.
18. O'Hearn, P.W. and Tennent, R.D.: Parametricity and local variables. J. ACM 42 (1995) 658-709.
19. Ward, N.: A recursion removal theorem. Preprint Durham, 1993.