References
Basu, S.K. and Misra, J.D. 1975. Proving loop programs. IEEE Transactions on Software Engineering, 1(1):76-86.
Berghammer, R., Schmidt, G., and Zierer, H. 1986. Symmetric quotients. Technical Report TUM-I8620, Technische Universitaet Muenchen, Muenchen, Germany.
Berghammer, R., Schmidt, G., and Zierer, H. 1989. Symmetric quotients and domain constructions. Information Processing Letters, 33:163-168.
DeMillo, R.A., Lipton, R.J., and Perlis, A.J. 1979. Social processes and proofs of theorems and programs. Communications of the ACM, 22(5):271-280.
Hoare, C.A.R. 1969. An ayiomatic basis for computer programming. Communications of the ACM, 12(10):576-583.
Hoare, C.A.R. and He, J.F. 1986. The weakest prespecification. Fundamentae Informaticae, IX: Part I; pp. 51-58; Part II: pp. 217–252.
Hoare, C.A.R. et al., 1987. Laws of programming. Communications of the ACM, 30(8):672-686.
Josephs, M.B. 1987. An introduction to the theory of specification and refinement. Technical Report RC 12993, IBM Corporation.
Manna, Z. 1974. A Mathematical Theory of Computation. New York: McGraw Hill.
Mills, H.D. 1975. The new math of computer programming. Communications of the ACM, 18(1).
Morris, J.H. and Wegbreit, B. 1977. Program verification by subgoal induction. In R.T. Yeh, editor, Current Trends in Programming Methodology, vol. II, chap. 8. Englewood Cliffs, NJ: Prentice Hall.
Riguet, J. 1948. Relations binaires, fermetures, et correspondances de gallois. Bulletin de la Société Mathématique de France, 76:114-155.
Ulam, S.M. 1976. Adventures of a Mathematician. New York, NY: Scribner.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mili, A. Desert Island Column: The Long Story of a Short Theorem. Automated Software Engineering 6, 199–204 (1999). https://doi.org/10.1023/A:1008770731005
Issue Date:
DOI: https://doi.org/10.1023/A:1008770731005