Abstraction and Verification in Alphard: Defining and Specifying Iteration and Generators

Communications of the ACM

Volumn 20, Issue 8, 1977, Pages 553-564

  Shaw, Mary ^a   Wulf, William A ^a   London, Ralph L ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

abstraction and representation; abstraction data types; assertions; control specialization; correctness; generators; invariants; iteration statements; modular decomposition; program specifications; programming languages; programming methodology; proofs of correctness; types; verification

Indexed keywords

COMPUTER PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0017526351     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359763.359782     Document Type: Article

References (17)

1. Dahl, O.-J., and Hoare, C.A.R. Hierarchical program structures. In Structured Programming, O.-J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, Academic Press, New York, 1972, pp. 175-220.
2. Hoare, C.A.R. A note on the for statement. BIT 12 (1972), 334-341.
3. Hoare, C.A.R. Proof of correctness of data representations. Acta Informatica 1, 4 (1972), 271-281.
4. Hoare, C.A.R., and Wirth, N. An axiomatic definition of the programming language Pascal. Acta Informatica 2, 4 (1973), 335-355.
5. Igarashi, S., London, R.L., and Luckham, D.C. Automatic program verification I: a logical basis and its implementation. Acta Informatica 4, 2 (1975), 145-182.
6. Jensen, K., and Wirth, N. PASCAL User Manual and Report. Lecture Notes in Computer Science, No. 18, Springer-Verlag, 1974.
7. Katz, S., and Manna, Z. A closer look at termination. Acta Informatica 5, 4 (1975), 333-352.
8. London, R.L., Shaw, M., and Wulf, W.A. Abstraction and verification in Alphard:a symbol table example. Tech. Reports, Inform. Sci. Inst., U. of Southern California, Marina del Rey, Calif.and Carnegie-Mellon U., Pittsburgh, Pa.1976.
9. Luckham, D.C., And Suzuki, N.Automatic program verification IV: Proof of termination within a weak logic of programs. Memo AIM-269, Stanford University, Stanford, Calif., Oct.1975.
10. McCarthy, J., Abrahams, P.W., Edwards, D.J., Hart, T.P., and Levin, M.I. LISP 1.5 Programmer's Manual. MIT Press, 1962.
11. Newell, A., Tonge, F., Feigenbaum, E. A., Green, B.F. Jr., And Mealy, G.H. Information Processing Language-V Manual. Prentice-Hall, Englewood Cliffs, N.J., Sec. Ed. 1964.
12. Shaw, M. Abstraction and verification in Alphard: design and verification of a tree handler. Proc. Fifth Texas Conf. on Computing Systems, 1976, pp. 86-94.
13. Shaw, M., Wulf, W.A., and London, R.L. Abstraction and verification in Alphard: Iteration and generators. Tech. Reports, Inform. Sci. Inst., U. of Southern California, Marina del Rey, Calif., and Carnegie-Mellon U., Pittsburgh, Pa., 1976.
14. Teitelman, W. Interlisp Reference Manual. Xerox Palo Alto Res. Ctr., Palo Alto, Calif., 1975.
15. Weissman, C. LISP 1.5 Primer, Dickenson, Encino, Calif., 1967.
16. Wulf, W.A., London, R.L., and Shaw, M. Abstraction and verification in Alphard: Introduction to language and methodology. Tech. Reports, Inform. Sci. Inst., U. of Southern California, Marina del Rey, Calif., and Carnegie-Mellon U., Pittsburgh, Pa., 1976.
17. Wulf, W.A., London, R.L., and Shaw, M. An introduction to the construction and verification of Alphard programs. IEEE Trans. on Software Eng. SE-2, 4 (Dec. 1976), 253-265.