Specifications, programs, and total correctness

Science of Computer Programming

Volumn 34, Issue 3, 1999, Pages 191-205

  Hehner, Eric C R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

FORMAL SPECIFICATIONS;

FORMAL LOGIC;

EID: 0033164891     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(98)00027-6     Document Type: Article

References (21)

1. R.-J.R. Back, A calculus of refinement for program derivations, Acta Informatica 25 (1998) 593-624.
2. R.-J. Back, J. von Wright, Refinement Calculus: A Systematic Introduction, Springer, Berlin, 1998.
3. P. Cousot, R. Cousot, Constructive versions of tarski's fixed point theorems, Pacific J. Math. 82 (1) (1979) 43-57.
4. M. Frappier, A Relational Basis for Program Construction by Parts, Ph.D. Thesis, University of Ottawa, 1995.
5. N.E. Fuchs, Specifications are (preferably) executable, IEE/BCS Software Eng. J. 7 (5) (1992) 323-334.
6. I.J. Hayes, C.B. Jones, Specifications are not (necessarily) executable, IEE/BCS Software Eng. J. 4 (6) (1989) 330-33 8.
7. E.C.R. Hehner, Predicative programming, Comm. ACM 27 (2) (1984) 134-151.
8. E.C.R Hehner, Termination is Timing, Internat. Conf. on Mathematics of Program Construction, Enschede, The Netherlands, June 1989; also in [19].
9. E.C.R. Hehner, A Practical Theory of Programming, Springer, Berlin, 1993.
10. E.C.R. Hehner, Abstractions of time, in: A.W. Roscoe (Ed.), A Classical Mind, Essays in Honour of C.A.R. Hoare, Chapter 12, Prentice-Hall International Series in Computer Science, London, 1994, pp. 191-210.
11. C.A.R. Hoare, Programs are predicates, in: C.A.R. Hoare, J.C. Shepherdson (Eds.), Mathematical Logic and Programming Languages, Prentice-Hall International, London, 1985, pp. 141-154;
12. and in: C.A.R. Hoare, C.B. Jones (eds.), Essays in Computing Science, Prentice-Hall International, London, 1989, pp. 333-349.
13. C.A.R. Hoare, Programs are predicates, ICOT J. 38 (1993).
14. C.A.R. Hoare, J. He, Unifying Theories of Programming, Prentice-Hall International, London, 1998.
15. C.B. Jones, Systematic Software Development Using VDM, Prentice-Hall International, London, 1986 and 1990.
16. L. Lamport, An old-fashioned recipe for real time, ACM TOPLAS 16 (5) (1994) 1543-1571.
17. C. Morgan, The cuppest capjunctive capping, and galois, in: A.W. Roscoe (Ed.), A Classical Mind, Essays in Honour of C.A.R. Hoare, Prentice-Hall International, London, 1994, pp. 317-332.
18. C. Morgan, Programming from Specifications, 2nd Ed., Prentice-Hall International, London, 1994.
19. J.M. Spivey, The Z Notation: A Reference Manual, Prentice-Hall International, London, 1989.
20. J.L.A. van de Snepscheut (Ed.), Mathematics of program construction, Lecture Notes in Computer Science, Vol. 375, Springer, Berlin, 1989, pp. 36-47.
21. N. Ward, I. Hayes, Applications of angelic nondeterminism, university of queensland, in: Proc. 6th Australian Software Engineering Conf., 1991.