The Specification Statement

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 10, Issue 3, 1988, Pages 403-419

  Morgan, Carroll ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Development calculus; guarded commands; miracles; procedural abstraction; program refinement; weakest preconditions

Indexed keywords

COMPUTER METATHEORY--PROGRAMMING THEORY;

DEVELOPMENT CALCULUS; DIJKSTRA'S PROGRAMMING LANGUAGE; PROCEDURAL ABSTRACTION; PROGRAM REFINEMENT; SPECIFICATION TECHNIQUES; WEAKEST PRECONDITIONS;

COMPUTER SOFTWARE;

EID: 0024036510     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/44501.44503     Document Type: Article

References (21)

1. Abrial, J.-R. Generalised substitutions. 26 Rue des Plantes, Paris 75014, France, 1987.
2. Back, R.-J. On the correctness of refinement steps in program development. Tech. Rep. A-1978-4, Dept. of Computer Science, Univ. of Helsinki, Helsinski, 1978.
3. Barringek, H., Cheng, J. H., AND Jones, C. B. A logic covering undefinedness in program proofs. Acta Inf. 21 (1984), 251–269.
4. Dijkstra, E. W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.
5. Gries, D. The Science of Programming. Springer-Verlag, New York, 1981.
6. Gries, D., and Prins, J. A new notion of encapsulation. In Proceedings of the SIGPLAN Symposium on Language Issues in Programming Environments (Seattle, Wash., June 25–28, 1985). ACM, New York, 1985, pp. 131–139.
7. Hayes, I. J., Ed. Specification Case Studies. Prentice-Hall, Englewood Cliffs, N.J., 1987.
8. Hehner, E. C. R. The Logic of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1984.
9. Hoare, C. A. R. Procedures and parameters: An axiomatic approach. In Symposium on Semantics of Algorithmic Languages. Notes in Mathematics 188, E. Engeler, Ed., Springer-Verlag, New York, 1971.
10. Hoare, C. A. R., and He, J. The weakest prespecification. Fundamenta Informaticae IX (1986), 51–84.
11. Jones, C. B. Systematic Software Development using V.D.M. Prentice-Hall, Englewood Cliffs, N.J., 1986.
12. Josephs, M. B. Formal methods for stepwise refinement in the Z specification language. Programming Research Group, Oxford Univ., 1986.
13. Meertens, L. Abstracto 84: The next generation. In Proceedings of the ACM 1979 Annual Conference (Detroit, Mich., Oct. 29–31, 1979). ACM, New York, 1979, pp. 33–39.
14. Morgan, C. C. Data refinement using miracles. Inf. Process. Lett. 26, 5 (Jan. 1988), 243–246.
15. Morgan, C. C. Procedures, parameters, and abstraction: Separate concerns. To appear in Sci. Comput. Program.
16. Morgan, C. C., and Robinson, K. A. Specification statements and refinement. IBM J. Res. Dev. 31, 5 (Sept. 1987), 546–555.
17. Morgan, C. C., and Sufrin, B. A. Specification of the UNIX filing system. IEEE Trans. Softw. Eng. SE-10, 2 (Mar. 1984).
18. Morris, J. A theoretical basis for stepwise refinement and the programming calculus. Sci. Comput. Program. 9, 3 (Dec. 1987), 298–306.
19. Nelson, G. A generalization of Dijkstra's calculus. Tech. Rep. 16, Digital Systems Research Center, Palo Alto, Calif., Apr. 1987.
20. Spivey, J. M. Understanding Z: A Specification Language and Its Formal Semantics. Cambridge Tracts in Theoretical Computer Science 3, CUP, Cambridge, U.K., 1988.
21. Wirth, N. Programming in Modula-2. Springer-Verlag, New York, 1982.