Typestate: A Programming Language Concept for Enhancing Software Reliability

IEEE Transactions on Software Engineering

Volumn SE-12, Issue 1, 1986, Pages 157-171

  Strom, Robert E ^a   Yemini, Shaula ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Program analysis; program verification; securitv; software reliability; type checking; typestate

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES;

HIGH-LEVEL LANGUAGES; TYPESTATE;

COMPUTER SOFTWARE;

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

References (18)

1. Reference Manual for the Ada Programming Language, ACM Ada-Tec, Draft Proposed ANSI Standard Document, July 1982.
2. D. M. Berry, R. A. Kemmerer, A. von Staa, and S. Yemini, “Toward modular verifiable exception handling,” Comput. Lang., vol. 5, pp. 77–110, 1980.
3. R. H. Campbell and A. N. Habermann, The Specification of Process Synchronization by Path Expressions (Lecture Notes in Computer Science), vol. 16. New York: Springer-Verlag, 1974.
4. M. H. Conner, “Process synchronization by behavior controllers,” Ph.D. dissertation, Univ. Texas at Austin, Dec. 1979.
5. E. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
6. S. L. Graham and M. Wegman, “A fast and usually linear algorithm for global flow analysis,” J. ACM, vol. 23, no. 1, pp. 172–202, Jan. 1976.
7. B. Hailpern and S. Owicki, “Modular verification of concurrent programs,” IBM Res. Rep. RC 9130, 1981.
8. C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. ACM, vol. 12, no. 10, Oct. 1969.
9. C. A. R. Hoare, “The Emperor’s old clothes,” reprinted in Commun. ACM, vol. 24, pp. 75–83, Feb. 1981.
10. R. Kieburtz and A. Silberschatz, “Access-right expressions,” Univ. Texas, Tech. Rep., 1979.
11. G. A. Kildall, “A unified approach to global program optimization,” in Proc. 1st ACM Symp. Principles of Programming Languages, pp. 194–206.
12. R. L. Schwartz and P. M. Melliar-Smith, “The finalization operation for abstract data types,” in Int. Conf. Software Eng., 1981.
13. M. Sherman, A. Hisgen, and J. Rosenberg, “A methodology for programming abstract data types in Ada,” in Proc. AdaTEC Conf. ADA, Oct. 1982.
14. R. E. Strom, “Mechanisms for compile-time enforcement of security,” in Proc. 10th ACM Symp. Principles of Programming Languages, Austin, TX, Jan. 1983.
15. R. Strom and N. Halim, “A new programming methodology for long-lived software systems,” IBM J. Res. Develop., Jan. 1984.
16. R. Strom and S. Yemini, “The NIL distributed systems programming language: A status report,” in Proc. NSF/SRC Seminar Semantics of Concurrency (Springer-Verlag Lecture Notes in Computer Science, Vol. 197), Pittsburgh, PA, July 1984.
17. R. Strom, S. Yemini, and P. Wegner, “Viewing Ada from a process model perspective,” Proc. Int. Ada Conf., Paris, 1985.
18. M. N. Wegman and F. K. Zadeck, “Constant propagation with conditional branches,” Proc. 12th ACM Symp. Principles of Programming Languages, Jan. 1985.