Understanding and Automating Algorithm Design

IEEE Transactions on Software Engineering

Volumn SE-11, Issue 11, 1985, Pages 1361-1374

  Kant, Elaine ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Automatic programming; automating algorithm design; human problem solving; program synthesis; protocol analysis

Indexed keywords

COMPUTER SOFTWARE - DESIGN;

ALGORITHM DESIGN; AUTOMATIC PROGRAMMING; AUTOMATIC SOFTWARE DESIGN;

COMPUTER PROGRAMMING;

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

References (28)

1. [1] B. Adelson and E. Soloway, “A model of software design,” in Chi, Glaser and Farr, Ed., The Nature of Expertise, Chi, Glasser, and Farr, Eds. Hillsdale, NJ: Lawrence Erlbaum, to be published.
2. [2] D. R. Barstow, “A perspective on automatic programming,” Artificial Intell. Mag., vol. 5, no. 1, Spring 1984.
3. [3] -, “The roles of knowledge and deduction in algorithm design,” in Automatic Program Construction Techniques, A. W. Biermann, Ed. New York: Macmillan, 1984, ch. 10, pp. 201–222.
4. [4] W. Bibel and K. M. Horning, “LOPS-A system based on a strategical approach to program synthesis,” in Proc. Int. Workshop Program Construction, France, Sept. 1980.
5. [5] A. W. Biermann, Ed., Automatic Program Construction Techniques. New York: Macmillan, 1984.
6. [6] B. Chandrasekaran and S. Radicchi, Eds., Computer Program Testing. Amsterdam, The Netherlands: North-Holland, 1981.
7. [7] D. Cohen, “A forward inference engine to aid in understanding specifications,” in Proc. AAAI-84, Amer. Ass. Artificial Intell., 1984.
8. [8] K. A. Ericsson and H. A. Simon, “Verbal reports as data,” Psychol. Rev., vol. 87, no. 3, pp. 215–251, May 1980.
9. [9] M. S. Feather, “A system for assisting program transformation,” ACM Trans. Program. Lang. Syst., vol. 4, no. 1, pp. 1–20, 1982.
10. [10] C. L. Forgy, OPS5 User's Manual, Dep. Comput. Sci., Carnegie-Mellon Mellon Univ. Pittsburgh, PA, Tech Rep. CMU-CS-81-135, July 1981.
11. [11] C. Green, D. Luckham, R. Balzer, T. Cheatham, and C. Rich, “Report on a knowledge-based software assistant,” Kestrel Inst., Tech. Rep. RADC-TR-83-195, Aug. 1983.
12. [12] D. Gries, The Science of Programming. New York: Springer-Verlag, 1981.
13. [13] R. Jeffries, A. A. Turner, and P. G. Polson, “The processes involved in designing software,” in Cognitive Skills and Their Acquisition, J. R. Anderson, Ed. Hillsdale, NJ: Lawrence Erlbaum, 1981, ch. 8.
14. [14] E. Kant and D. R. Barstow, “The refinement paradigm: The interaction of coding and efficiency knowledge in program synthesis,” in Interactive Programming Environments, D. R. Barstow, H. E. Shrober, and E. Sandewall, Eds. New York, McGraw-Hill, 1984, pp. 487–513.
15. [15] E. Kant, Efficiency in Program Synthesis. UMI Research Press, 1981.
16. [16] E. Kant and A. Newell, “Naive algorithm design techniques: A case study,” in Proc. European Conf. Artificial Intell., Orsay, France, July 1982. Reprinted in Progress in Artificial Intell., L. Steels and J. A. Campbell, Eds. Ellis Horwood, 1985.
17. [17] -, “Problem solving techniques for the design of algorithms,” Inform. Processing and Management, vol. 20, no. 1, Spring 1984.
18. [18] -, “An automatic algorithm designer: An initial implementation,” in Proc. AAAI-83, Amer. Ass. Artificial Intell., 1983.
19. [19] J. E. Laird, “Universal subgoaling,” Technical Report CMU-CS-84-129 129 Dep. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-C S-84-129, May 1984.
20. [20] D. T. Lee and F. P. Preparata, “Computational geometry-A survey,” IEEE Trans. Comput., vol. C-33, Dec. 1984.
21. [21] A. Newell and H. Simon, Human Problem Solving. Englewood Cliffs, NJ: Prentice-Hall, 1972.
22. [22] H. Partsch and R. Steinbruggen, “Program transformation systems,” ACM Comput. Surveys, vol. 15, no. 3, Sept. 1983.
23. [23] G. Polya, How to Solve it. New York: Doubleday-Anchor, 1957.
24. [24] C. Rich and H. E. Shrobe, “Initial report on a Lisp programmer's apprentice,” in Interactive Programming Environments, D. R. Barstow, H. E. Shrober, and E. Sandewall, Eds. New York: McGraw-Hill, Hill, 1984, pp. 443–463.
25. [25] E. Y. Shapiro, “An algorithm that infers theories from facts,” in Proc. IJCAI-81, 1981, pp. 446–451.
26. [26] D. R. Smith, “Top-down synthesis of simple divide and conquer algorithms, Naval Postgraduate School, Tech. Rep. NPS52-82-011, Nov. 1982.
27. [27] D. M. Steier and E. Kant, “The roles of execution and analysis in algorithm design,” IEEE Trans. Software Eng., this issue, pp. 1375–1386.
28. [28] G. J. Sussman, A Computer Model of Skill Acquisition. New York: American Elsevier, 1975.