Systèmes de déduction pour les arbres et les schémas de programmes (I)
- 1 January 1980
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 14 (3) , 247-278
- https://doi.org/10.1051/ita/1980140302471
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Proof rules for gotosActa Informatica, 1979
- Program equivalence and provabilityPublished by Springer Nature ,1979
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- The algebraic semantics of recursive program schemesPublished by Springer Nature ,1978
- An introduction to algorithmic logic. Metamathematical investigations in the theory of programsBanach Center Publications, 1977
- Computability and completeness in logics of programs (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1977
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Program proving: Jumps and functionsActa Informatica, 1972
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- An axiomatic basis for computer programmingCommunications of the ACM, 1969