Skip to main content
SpringerLink
Log in

Program equivalence and provability

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

Abstract

Given a Hoare-like deduction system in which can be proved partial correctness assertions of the form [P] S [Q],where S is a program and P, Q are first-order formulas, we are interested in the following question : "If ⊩[P] S1

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K. Bergstra, J. and Meerteens L., Recursive assertions are not enough-or are they ? Theor. Comput. Sci. 8, 1 (February 1979).

    Google Scholar 

  2. Clarke,E., Programming language constructs for which it is impossible to obtain "good" Hoare like axiom systems. Fourth ACM Symposium on Principles of Programming Languages (1977).

    Google Scholar 

  3. Cook, S., Soundness and completeness for program verification, SIAM Journal of Computing 7, 1 (1978).

    Article  Google Scholar 

  4. Courcelle, B. and Nivat, M., The algebraic semantics of recursive program schemes. MFCS 1978, Springer Lecture Notes no62.

    Google Scholar 

  5. Cousineau, G.,The algebraic structure of flowcharts.This symposium.

    Google Scholar 

  6. Cousineau, G., An algebraic definition for control structures. To appear in Theor. Comput. Sci.

    Google Scholar 

  7. Doner, Tree acceptors and some of their applications. J. of Comput. and System Sci. 4 (1970).

    Google Scholar 

  8. Enjalbert, P., Systèmes de déduction pour les arbres et les schémas de programmes. 4ème Colloque de Lille sur les arbres en algèbre et en programmation (1979).

    Google Scholar 

  9. Gorelick, G., A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report no 75. University of Toronto (January 1975).

    Google Scholar 

  10. Harel, D., Meyer, A. and Pratt, V., Computability and completeness in logics of programs. 9th ACM symposium on Theory of Computing. Boulder (1977).

    Google Scholar 

  11. Ianov, I., The logical schemes of algorithms. In:Problems of cybernetics, Pergamon Press (1960).

    Google Scholar 

  12. Lukham, D., Park, D., and Paterson, M., On formalized computer programs. J. of Comput. and System Sci. 4 (1970).

    Google Scholar 

  13. Manna, Z., Mathematical theory of computation, Mc Graw-Hill (1974).

    Google Scholar 

  14. Wand, M., A new incompletness result for Hoare's systems. JACM 25, 1 (1978).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P., Université PARIS VI, 75221, Paris 5, France

    G. Cousineau

  2. THOMSON-CSF/LCR Domaine de Corbeville, B.P.10, 91401, Orsay, France

    P. Enjalbert

Authors
  1. G. Cousineau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Enjalbert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cousineau, G., Enjalbert, P. (1979). Program equivalence and provability. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation