Advertisement

A calculus to build up correct programs

  • P. A. Miglioli
  • M. Ornaghi
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Keywords

Transformation Rule Introduction Rule Logical Content Mechanical Theorem Prove Connection Rule 
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. 1.
    Burstall, R.M. and Darlington, J., Some transformations for developing recursive programs. Proc. of 1975 International Conference on Reliable Software, Los Angeles.Google Scholar
  2. 2.
    Chang, C.L. and Lee, R.C.T., Symbolic logic and mechanical theorem proving, Academic Press Inc., New Jork 1973.Google Scholar
  3. 3.
    Chang, C.L., Lee, R.C.T. and Waldinger, R.J., An improved program-synthesizing algorithm and its correctness. Com. ACM, vol.17; n.4, 1974.Google Scholar
  4. 4.
    Constable, R.L., Constructive mathematics and automatic program writers. IFIP Congress 1971, North Holland, Amsterdam.Google Scholar
  5. 5.
    Darlington, J., Application of program tarnsformation to program synthesis. Proc. of International Symposium on Proving and Improving Programs, Arc et Senans, France.Google Scholar
  6. 6.
    Degli Antoni, G., Miglioli, P.A., and Ornaghi, M., The synthesis of programs as an approach to the construction of reliable programs. Proc. of International Symposium on Proving and Improving Programs, Arc et Senans, France, 1975.Google Scholar
  7. 7.
    Dershowitz, N. and Manna, Z., On automating structured programming. Proc. of International Symposium on Proving and Improving Programs, Arc et Senans, France, 1975.Google Scholar
  8. 8.
    Dijkstra, E.W., Guarded commands, nondeterminacy and formal derivation of programs. Comm. of the ACM, vol 18, n.8.Google Scholar
  9. 9.
    Hoare, C.A.R., An axiomatic basis of computer programming. Com of the ACM, vol.12, n.10, 1969.Google Scholar
  10. 10.
    Kleene, S.C., Introduction to methamatematics, North Holland, Amsterdam 1950.Google Scholar
  11. 11.
    Kowalski, R., Predicate logic as a programming language. Proc. IFIP 1974.Google Scholar
  12. 12.
    Manna, Z., The correctness of programs. J. of Comp. and System Science, 3, 1969.Google Scholar
  13. 13.
    Miglioli,P. and Ornaghi,M., Notes on motivation languages and synthesis maps. Internal report of the Instituto di Cibernetica dell'Università di Milano, Via Viotti, 5 Milano (1976), available.Google Scholar
  14. 14.
    Miglioli,M. and Ornaghi,M., A purely logical computing model: the open proofs as programs. Internal report of the Istituto di Cibernetica — Università di Milano, Via Viotti, 5 Milano (1977), available (presented at the Workshop on Artificial Intelligence, Bad Honnef 1977, Germany).Google Scholar
  15. 15.
    Prawitz, D., Ideas and results in proof-theory. Proc. of the second scandinavian logic symposium, North Holland, Amsterdam.Google Scholar
  16. 16.
    Degli Antoni,G., Miglioli, P. and Ornaghi,M., Procedure per la sintesi di programmi. To appear in Informatica.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • P. A. Miglioli
    • 1
  • M. Ornaghi
    • 1
  1. 1.Istituto di Cibernetica dell'Università di MilanoMilanoItaly

Personalised recommendations