The Refinement Paradigm: The Interaction of Coding and Efficiency Knowledge in Program Synthesis

IEEE Transactions on Software Engineering

Volumn SE-7, Issue 5, 1981, Pages 458-471

  Barstow, David R ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SCHLUMBERGER DOLL RESEARCH   (United States)

Author keywords

Automatic programming; program development; program efficiency; program synthesis; refinement paradigm; stepwise refinement

Indexed keywords

COMPUTER PROGRAMMING;

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

References (30)

1. R. Balzer, “Transformational implementation: An example,” IEEE Trans. Software Eng., vol. SE-7, pp. 3–14, Jan. 1981.
2. D. R. Barstow and E. Kant, “Observations on the interaction between coding and efficiency knowledge in the PSI program synthesis system,” in Proc. 2nd Int. Conf. Software Eng., Long Beach, CA, Oct. 1976, pp. 19–31
3. D. R. Barstow, Knowledge-Based Program Construction. New York: Elsevier, 1979.
4. “An experiment in knowledge-based automatic programming,” ming,” Artificial Intell., vol. 12, Aug. 1979.
5. “The roles of knowledge knowledge and deduction in algorithm design,” in Machine Intelligence, D. Michie and Y. H. Pao, New York: Wiley, 1981
6. R. Burstall and J. Darlington, “A transformation system for developing recursive programs,” J. Ass. Comput. Mach., vol. 24, Jan. 1977
7. R. G. G. Cattell, “Formalization and automatic derivation of code generators,” Dep. Comput. Sci., Carnegie-Mellon Univ., Pitts-burgh, PA, Tech. Rep. CMU-CS-78-115, Apr. 1978; also, Ph.D. dissertation
8. T. E. Cheatham, J. A. Townley, and G. H. Holloway, “A system for program refinement,” in Proc. 4th Int. Conf. Software Eng., Sept. 1979, pp. 53–63
9. O. J. Dahl, E. W. Dijkstra, and C.A.R. Hoare, Structured Programming. New York: Academic, 1972
10. C. W. Fraser, “Automatic generation of code generators,” Ph.D. dissertation, Dep. Comput. Sci., Yale Univ., New Haven, CT, 1977
11. C. C. Green and D. R. Barstow, “On program synthesis knowledge,” Artificial Intell., vol. 10, 1978
12. C. C. Green, R. Gabriel, E. Kant, B. Kedzierski, B. McCune, J. Phillips, S. Tappel, and S. Westfold, “Results in knowledge-based program synthesis,” in Proc. 6th Int. Joint Conf. Artificial Intell., Tokyo, Japan, Aug. 1979, pp. 342–344
13. E. Kant, “A knowledge-based approach to using efficiency estimation in program synthesis,” in Proc. 6th Int. Joint Conf. Artificial Intell., Tokyo, Japan, Aug. 1979, pp. 457–462
14. “Efficiency considerations in program synthesis: A knowledge-based approach,” Dep. Comput. Sci., Stanford Univ., Stan-ford, CA, Tech. Rep. STAN-CS-79-755, Sept. 1979; also, Ph.D. dissertation
15. D. E. Knuth, “Bit manipulation,” The Art of Computer Programming, Draft of Section 7.1
16. B. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, “Abstraction mechanisms in CLU,” Commun. Ass. Comput. Mach., vol. 20, Aug. 1978
17. J. R. Low, “Automatic data structure selection: An example and overview,” Commun. Ass. Comput. Mach., vol. 21, May 1978
18. Z. Manna and R. Waldinger, “Synthesis: Dreams = > programs,” IEEE Trans. Software Eng., vol. SE-5, July 1979
19. M. Morgenstern, “Automated design and optimization of management information system software,” Ph.D. dissertation, Lab. Comput. Sci., Massachusetts Inst. of Technol., Sept. 1976
20. Charles Rich, “Inspection methods in programming,” Ph.D. dissertation, Massachusetts Inst. of Technol., June 1980
21. S. J. Rosenschein and S. M. Katz, “Selection of representations for data structures,” in Proc. Symp. Artificial lntell. Intell. Programming Lang., Aug. 1977, pp. 147-154; also in Joint SIGPLAN Notices, vol. 12, no. 8, and SIGART Newsletter, vol. 64
22. P. D. Rovner, “Automatic representation selection for associative data structures,” Dep. Comput. Sci., Univ. of Rochester, Tech. Rep. TR10, Sept. 1976
23. L. A. Rowe, “A formalization of modelling structures and the generation of efficient implementation structures,” Ph.D. dissertation, Dep. Comput. Sci., Univ. of California, Irvine, June 1976
24. J. T. Schwartz, “On programming: An interim report on the SETL project, revised,” Dep. Comput. Sci., Courant Inst. of Math. Sci., New York Univ., June, 1975
25. M. Shaw, “A formal system for specifying and verifying program performance,” Dep. Comput. Sci., Carnegie-Mellon Univ., Tech. Rep. CMU-CS-79-129, June, 1979
26. H. E. Shrobe, “Dependency directed reasoning for complex pro-gram understanding,” Massachusetts Inst. of Technol., Tech. Rep. 503, Apr. 1973
27. F. Tompa, and R. Ramirez, “An aid for the selection of efficient storage structures,” Dep. Comput. Sci., Univ. of Waterloo, Tech. Rep. CS-80-46, Oct. 1980
28. B. Wegbreit, “Goal-directed program transformation,” presented at 3rd Annu. Symp. Principles of Programming Lang. ACM SIGPLAN/SIGACT, Jan. 1976
29. N. Wirth, “Program development by stepwise refinement,” Commun. Ass. Comput. Mach., vol. 14, Apr. 1971
30. W. A. Wulf, R. L. London, and M. Shaw, “Abstraction and verification in Alphard: An introduction to language and methodology,” Dep. Comput. Sci., Carnegie-Mellon Univ., 1976