Toward a classification approach to design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 62-84

  Smith, Douglas R ^a  

^a KESTREL INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SOFTWARE ENGINEERING; SPECIFICATIONS; TAXONOMIES;

ALGORITHM DESIGN; CLASSIFICATION APPROACH; DESIGN CONCEPT; DESIGN THEORY; MORPHISMS; REQUIREMENT SPECIFICATION; SPECIFICATION MORPHISM;

COMPUTATION THEORY;

EID: 84947912089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014308     Document Type: Conference Paper

References (27)

1. Astesiano, E., and Wirsing, M. An introduction to ASL. In Program Specification and Transformation, L. Meertens, Ed. North-Holland, Amsterdam, 1987, pp. 343-365.
2. Blaine, L., and Goldberg, A. DTRE - a semi-automatic transformation system. In Constructing Programs from Specifications, B. Möller, Ed. North-Holland, Amsterdam, 1991, pp. 165-204.
3. Broy, M., Wirsing, M., and Pepper, P. On the algebraic definition of programming languages. ACM Transactions on Programming Languages and Systems 9, 1 (January 1987), 54-99.
4. Ehrig, H., Kreowski, H. J., Thatcher, J., Wagner, E., and Wright, J. Parameter passing in algebraic specification languages. In Proceedings, Workshop on Program Specification (Aarhus, Denmark, Aug. 1981), vol. 134, pp. 322-369.
5. Ehrig, H., and Mahr, B.Fundamentals of Algebraic Specification, vol. 2: Module Specifications and Constraints. Springer-Verlag, Berlin, 1990.
6. Enderton, H. B.A Mathematical Introduction to Logic. Academic Press, New York, 1972.
7. Goguen, J. A., Thatcher, J. W., and Wagner, E. G. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology, Vol. 4: Data Structuring, R. Yeh, Ed. Prentice-Hall, Englewood Cliffs, NJ, 1978.
8. Goguen, J. A., Thatcher, J. W., Wagner, E. G., and Wright, J. B. Initial algebra semantics and continuous algebras. Journal of the ACM 24, 1 (January 1977), 68-95.
9. Goguen, J. A., and Winkler, T. Introducing OBJ3. Tech. Rep. SRI-CSL-88-09, SRI International, Menlo Park, California, 1988.
10. Guttag, J. V., and Horning, J. J. The algebraic specification of abstract data types. Acta Inf. 10 (1978), 27-52.
11. Hoare, C. Varieties of programming languages. Tech. rep., Programming Research Group, University of Oxford, Oxford, UK, 1989.
12. Lowry, M. R. Algorithm synthesis through problem reformulation. In Proceedings of the 1987 National Conference on Artificial Intelligence(Seattle, WA, July 13-17, 1987).
13. Papadimitriou, C. H., and Steiglitz, K.Combinatorial Optimisation: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.
14. Partsch, H.Specification and Transformation of Programs: A Formal Approach to Software Development. Springer-Verlag, New York, 1990.
15. Sannella, D., and Tarlecki, A. Toward formal development of programs from algebraic specifications: Implementations revisited. Acta Informatica 25, 3 (1988), 233-281.
16. Smith, D. R. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27, 1 (September 1985), 43-96.
17. Readings in Artificial Intelligence and Software Engineering, C. Rich and R. Waters, Eds., Los Altos, CA, Morgan Kaufmann, 1986.
18. Smith, D. R., and Lowry, M. R. Algorithm theories and design tactics. In Proceedings of the International Conference on Mathematics of Program Construction, LNCS 375, L. van de Snepscheut, Ed. Springer-Verlag, Berlin, 1989, pp. 379-398. (reprinted in Science of Computer Programming, 14(2-3), October 1990, pp. 305-321).
19. Smith, D. R. KIDS - a semi-automatic program development system. IEEE Transactions on Software Engineering Special Issue on Formal Methods in Software Engineering 16, 9 (September 1990), 1024-1043.
20. Smith, D. R. Structure and design of problem reduction generators. In Constructing Programs from Specifications, B. Möller, Ed. North-Holland, Amsterdam, 1991, pp. 91-124.
21. Smith, D. R. Constructing specification morphisms. Journal of Symbolic Computation, Special Issue on Automatic Programming 15, 5-6 (May-June 1993), 571-606.
22. Smith, D. R. Derivation of parallel sorting algorithms. In Parallel Algorithm Derivation and Program Transformation, R. Paige, J. Reif, and R. Wachter, Eds. Kluwer Academic Publishers, New York, 1993, pp. 55-69.
23. Srinivas, Y. V. Algebraic specification for domains. In Domain Analysis: Acquisition of Reusable Information for Software Construction, R. Prieto-Diaz and G. Arango, Eds. IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 90-124.
24. tm formal support for composing software. In Proceedings of the Conference on Mathematics of Program Construction, B. Moeller, Ed. Springer-Verlag, Berlin, 1995. Lecture Notes in Computer Science, Vol. 947.
25. Turski, W. M., and Maibaum, T. E.The Specification of Computer Programs. Addison-Wesley, Wokingham, England, 1987.
26. Veloso, P. A. Problem solving by interpretation of theories. In Contemporary Mathematics, vol. 69. American Mathematical Society, Providence, Rhode Island, 1988, pp. 241-250.
27. Wirsing, M. Algebraic specification. In Formal Models and Semantics, J. van Leeuwen, Ed., vol. B of Handbook of Theoretical Computer Science. MIT Press/Elsevier, 1990, pp. 675-788.