Theory of Modules

IEEE Transactions on Software Engineering

Volumn SE-13, Issue 7, 1987, Pages 820-829

  Gannon, John D ^a   Hamlet, Richard G ^b   Mills, Harlan D ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

Abstract data types; functional semantics; modules; program specifications; program verification; programming methodology

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY;

ABSTRACT DATA TYPES; FUNCTIONAL SEMANTICS; MODULE PROOF THEORY; PROGRAM SPECIFICATIONS; PROGRAM VERIFICATION;

COMPUTER SOFTWARE;

EID: 0023384958     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1987.233493     Document Type: Article

References (8)

1. O.J. Dahl, B. Myhrhaug, and K. Nygaard, “The SIMULA 67 common base language,” Norwegian Computing Center, Oslo, Publ. S-22, 1970.
2. C. A. R. Hoare, “Proof of correctness of data representations,” Acta Inform., vol. 1, pp. 271–281, 1972.
3. W. A. Wulf, R. L. London, and M. Shaw, “An introduction to the construction and verification of Alphard programs,” IEEE Trans. Software Eng., vol. SE-2, pp. 253–265, 1976.
4. J. Guttag and J. Homing, “The algebraic specification of abstract data types,” Acta Inform., vol. 10, pp. 27–52, 1978.
5. J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, “Initial algebra semantics and continuous algebras,” J. ACM, vol. 24, pp. 68–95, 1977.
6. H. D. Mills, V. R. Basili, J. D. Gannon, and R. G. Hamlet, Principles of Computer Programming: A Mathematical Approach. Boston, MA: Allyn & Bacon, 1987.
7. R. G. Hamlet and H. D. Mills, “Functional analysis of programs,” Dep. Comput. Sci. Eng., Oregon Graduate Center, Beaverton, Tech. Rep. CS/E 84–006, Oct. 1984.
8. R. L. London, J. V. Guttag, J. J. Homing, B. W. Lampson, J. G. Mitchell, and G. J. Popek, “Proof rules for the programming language Euclid,” Acta Inform., vol. 10, pp. 1–26, 1978.