Type Transformations

IEEE Transactions on Software Engineering

Volumn SE-7, Issue 1, 1981, Pages 32-39

  Wile, David S ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Abstract data types; optimization strategy; program optimization; program specification; program transformation

Indexed keywords

DATA PROCESSING;

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

References (20)

1. B. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, “Abstraction mechanisms in CLU,” Commun. Ass. Comput. Mach., vol. 20, pp. 564–576, Aug. 1977.
2. C. M. Geschke, J. H. Morris, Jr., and R. H. Satterthwaite, “Early experience with Mesa,” in Proc. Int. Conf. Reliable Software. New York: IEEE, 138–152.
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, Dec. 1976.
4. B. W. Lampson, J. J. Horning, R. L. London, J. G. Mitchell, and G. J. Popek, “Report on the programming language Euclid,” ACM SIGPLANNotices, vol. 12, Feb. 1977.
5. O. J. Dahl, B. Myhrhaug, and K. Nygaard, “The SIMULA 67 common base language,” Norwegian Comput. Center, Oslo, Tech. Rep. S-22, 1970.
6. J. V. Guttag, E. Horowitz, and D. R. Musser, “Abstract data types and software validation,” Commun. Ass. Comput. Mach., vol. 21, Dec. 1978.
7. C. A. R. Hoare, “Proof of correctness of data representations,” Acta Informatica, no. 1, pp. 271-281, 1972.
8. R. M. Burstall and J. Darlington, “A transformation system for developing recursive programs,” J. Ass. Comput. Mach., vol. 24, pp. 44–67, 1977.
9. S. L. Gerhart, “Knowledge about programs: A model and a case study,” in Proc. Int; Conf. Reliable Software. New York: IEEE, 1975, pp. 88–95.
10. D. B. Loveman, “Program improvement by source to source transformation,” J. Ass. Comput. Mach., vol. 24, pp. 121–145, Jan. 1977.
11. T. A. Standish, D. C. Harriman, D. F. Kibler, and J. M. Neighbors, “Improving and refining programs by program manipulation,” in ACM Nat. Conf. Proc., 1976, pp. 509–516.
12. J. J. Arsac, “Syntactic source to source transforms and program manipulation,” Commun. Ass. Comput. Mach., vol. 22, pp. 43–54, 54, 1979.
13. R. Balzer, N. Goldman, and D. Wile, “On the transformational implementation approach to programming,” in Proc. 2nd Int. Conf. Software Eng. New York: IEEE, 1976, pp. 337–334.
14. D. R. Barstow, Knowledge-Based Program Construction. Elsevier North-Holland, 1979.
15. F. L. Bauer, “Programming as an evolutionary process,” in Proc. 2nd Int. Conf. Software Eng. New York: IEEE, 1976 pp. 233–234.
16. R. M. Burstall and J. A. Goguen, “Putting theories together to make specifications,” in Proc. 5th Int. Joint Conf. Artificial lntell., Cambridge, MA, 1977, pp. 1045–1058.
17. M. S. Feather, “Program transformation applied to the telegram problem,” Univ. Edinburgh, Tech. Rep. 47, 1977.
18. R. B. K. Dewar, A. Grand, S-C. Liu, and J. T. Schwartz, “Programming by refinement, as exemplified by the SETL representation sublanguage,” ACM Trans. Programming Languages Syst., no. 1, pp. 27–49, 1979.
19. B. Wegbreit and J. M. Spitzen, “Proving properties of complex data structures,” J. Ass. Comput. Mach., vol. 23, pp. 389–396, Apr. 1976.
20. R. W. Floyd, “Algorithms 245, TREESORT 3,” Commun. Ass. Comput. Mach., vol. 7, p. 701, Dec. 1 9 64.