Skip to main content
SpringerLink
Log in

Relational heuristics for the design of deterministic programs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It has been shown that the design of deterministic programs can be formulated as the resolution of relational equations. Because relational calculi are not sufficiently structured, there are no algorithmic solutions to relational equations. In this paper, we formulate some heuristic solutions to these equations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barstow, D.: Knowledge-based program construction. Elsevier North Holland 1979

  2. Barstow, D.: A perspective an automatic programming. Proceedings, 8th International Joint Conference on Artificial Intelligence. August 8–12, 1983. Karlsruhe, West Germany

  3. Basili, V.R., Dunlop, D.D.: Comparative analysis of functional correctness. ACM Comput. Surv. 14, 229–244 (1982)

    Google Scholar 

  4. Basili, V.R., Dunlop, D.D.: A heuristic for developing loop functions. IEEE Trans. Software Eng. SE-10, 275–285 (1984)

    Google Scholar 

  5. Basili, V.R., Dunlop, D.D.: Generalizing specifications for Uniformly Implemented Loops. ACM TOPLAS, 7, 137–158 (1985)

    Google Scholar 

  6. Basu, S., Misra, J.: Proving loop programs. IEEE SE-1, 76–86 (1975)

    Google Scholar 

  7. Berghammer, R., Schmidt, G.: Discrete ordering relations. Discrete Math. 43, 1–7 (1981)

    Google Scholar 

  8. Desharnais, J.: Conception de programmes par decomposition relationelle: proposition de quelques heuristiques. M.Sc. Thesis, Universite Laval, Quebec, 1985

    Google Scholar 

  9. Dijkstra, E.W.: Guarded commands, nondeterminancy and formal derivation of programs. Commun. ACM 18, 453–457 (1975)

    Google Scholar 

  10. Gries, D.: The science of programming. Berlin-Heidelberg-New York: Springer 1981

    Google Scholar 

  11. Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12, 576–583 (1969)

    Google Scholar 

  12. Jensen, K., Wirth, N.: Pascal user manual and report. Berlin-Heidelberg-New York: Springer 1974

    Google Scholar 

  13. Kandzia, P., Mangelmann, M.: The use of transitively irreducible kernels of full families of functional references in logical data base design. Lect. Notes Comput. Sci. Vol. 100. Berlin-Heidelberg-New York: Springer 1980

    Google Scholar 

  14. Linger, R.C., Mills, H.D., Witt, B.I.: Structured programming: theory and practice. Reading, Ma, Addison-Wesley 1979

    Google Scholar 

  15. Manna, Z.: Mathematical theory of computation. New York: McGraw-Hill 1974

    Google Scholar 

  16. Manna, Z., Waldinger, R.: The logic of computer programming. IEEE Trans. Software Eng. SE-4, 199–229 (1978)

    Google Scholar 

  17. Meyer, B.: On formalism in specification. IEEE Software 2, 6–27 (1985)

    Google Scholar 

  18. Mili, A.: A relational approach to the design of deterministic programs. Acta Inf. 20, 315–328 (1983)

    Google Scholar 

  19. Mili, A.: Verifying programs by induction on their data structure: general format and applications. Inf. Process. Lett. 17, 155–160 (1983)

    Google Scholar 

  20. Mills, H.D.: Mathematical foundations for structured programming. IBM Federal Systems Division, Internal Report, 1972. Gaithersburgh, MD

  21. Mills, H.D.: The new math of computer programming. CACM 18, 43–48 (1975)

    Google Scholar 

  22. Mills, H.D., Basili, V.R., Gannon, J.D., Hamlet, R.G.: Principles of computer programming: a mathematical approach. Boston (MA): Allyn&Bacon Inc, 1987

    Google Scholar 

  23. Milner, R., Strachey, C.: A theory of programming language semantics. London: Chapman and Hall 1976

    Google Scholar 

  24. Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. Technical monograph, PRG-6. Programming Research group. University of Oxford, 1971

  25. Stoy, J.: Denotational semantics: the scott Strachey approach. Boston: M.I.T Press, 1977

    Google Scholar 

  26. Suppes, P.: Axiomatic set theory. New York: Dover Publications 1972

    Google Scholar 

  27. Tarski, A.: On the calculus of relations. J. Symb. Logic 6, 73–89 (1941)

    Google Scholar 

  28. Vivien, M.: Thèse de doctorat d'etat. Université de Maine. Le Mans, France, 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Faculty of Sciences of Tunis, Campus Universitaire Belvédère, 1060, Tunis, Tunisia

    Ali Mili

  2. School of Computer Science, McGill University, H3A 2K6, Montreal, PQ, Canada

    Jules Desharnais

  3. School of Engineering and Computer Science, Oakland University, 48063, Rochester, MI, USA

    Fatma Mili

Authors
  1. Ali Mili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jules Desharnais
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fatma Mili
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Part of this work was carried out while the first and second author were at Laval University in Québec. Canada: it was supported by the National Research Council of Canada through a research grant to the first author and a scholarship to the second author. Presently, this research is supported by a grant to the first and third authors from the Tunisian Council on Scientific and Technical Research

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mili, A., Desharnais, J. & Mili, F. Relational heuristics for the design of deterministic programs. Acta Informatica 24, 239–276 (1987). https://doi.org/10.1007/BF00265990

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00265990

Keywords

Search

Navigation