Advertisement

Problem Solving Strategies for the Derivation of Programs

  • Jaime Bohórquez
  • Rodrigo Cardoso
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)

Abstract

Methods and principles inspired in problem solving strategies for program synthesis are presented. This approach complements the calculational style of programming, emphasizing the consideration of the meaning of the formulas involved along the derivation of programs.

Keywords

Binary Tree Explicit Information Linear Search Unexplored Area Recursive Definition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aho74]
    Aho, A.V., J.E. Hopcroft, J.D. Ullman [1974], The Design and Analysis of Computer Algorithms. Addison-Wesley.Google Scholar
  2. [Bac86]
    Backhouse, R.C. [1986], Program Construction and Verification. Prentice-Hall.Google Scholar
  3. [Car91]
    Cardoso, R. [1991], Verificacion y desarrollo de programas. Ediciones Uniandes.Google Scholar
  4. [Coh90]
    Cohen, E. [1990], Programming in the 1990s: An introduction to the calculation of programs. Springer-Verlag.Google Scholar
  5. [Dij75]
    Dijkstra, E.W. [1975], Guarded Commands, Nondeterminacy and the Formal Derivation of Programs. Communications of the ACM, 18, 453–457.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [Dij76]
    Dijkstra, E.W. [1976], A Discipline of Programming. Prentice-Hall.Google Scholar
  7. [Dij88]
    Dijkstra, E.W., W.H.J. Feijen [1988], A Method of Programming. Addison-Wesley (translated from the 1984 Dutch edition).Google Scholar
  8. [Dij89]
    Dijkstra, E.W., W.H.J. Feijen [1989], The linear search revisited. Structured Programming, 1.Google Scholar
  9. [Gri78]
    Gries, D. (ed.) [1978], Programming Methodology. Springer-Verlag.Google Scholar
  10. [Gri81]
    Gries, D. [1981], The Science of Computer Programming. Springer-Verlag.Google Scholar
  11. [Heh84]
    Hehner, E.C.R. [1984], The Logic of Programming. Prentice-Hall.Google Scholar
  12. [Hoa69]
    Hoare, C.A.R. [1969], An Axiomatic Basis for Computer Programming. CACM 12.Google Scholar
  13. [Hoa89]
    Hoare, C.A.R. [1989], An Axiomatic Approach to Computer Programming. In: Essays in Computing Science, C.A.R. Hoare and C.B. Jones (eds.). Prentice-Hall.Google Scholar
  14. [Hor78]
    Horowitz, E., S. Sahni [1978], Fundamental Algorithms. Computer Science Press.Google Scholar
  15. [Kal90]
    Kaldewaij, A. [1990], Programming: The Derivation of Algorithms. Prentice-Hall.Google Scholar
  16. [Rem]
    Rem, M., Small Programming Exercises. Science of Computer Programming (on-going column).Google Scholar
  17. [Rey81]
    Reynolds, J.C. [1981], The Craft of Programming. Prentice-Hall.Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Jaime Bohórquez
    • 1
  • Rodrigo Cardoso
    • 1
  1. 1.Universidad de los AndesBogotáColombia

Personalised recommendations