Systèmes de déduction pour les arbres et les schémas de programmes (I)

P. Enjalbert

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1980)

  • Volume: 14, Issue: 3, page 247-278
  • ISSN: 0988-3754

How to cite

top

Enjalbert, P.. "Systèmes de déduction pour les arbres et les schémas de programmes (I)." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 14.3 (1980): 247-278. <http://eudml.org/doc/92127>.

@article{Enjalbert1980,
author = {Enjalbert, P.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {proof system for partial correctness of programs; algebraic semantic; Hoare rules; program schemes},
language = {fre},
number = {3},
pages = {247-278},
publisher = {EDP-Sciences},
title = {Systèmes de déduction pour les arbres et les schémas de programmes (I)},
url = {http://eudml.org/doc/92127},
volume = {14},
year = {1980},
}

TY - JOUR
AU - Enjalbert, P.
TI - Systèmes de déduction pour les arbres et les schémas de programmes (I)
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1980
PB - EDP-Sciences
VL - 14
IS - 3
SP - 247
EP - 278
LA - fre
KW - proof system for partial correctness of programs; algebraic semantic; Hoare rules; program schemes
UR - http://eudml.org/doc/92127
ER -

References

top
  1. 1. J. ARSACLa construction de programmes structurés, Dunod, Paris, 1977. Zbl0451.68014
  2. 2. M. A. ARBIB et S. ALAGIC, Proof Rules for « Gotos », Acta Informatica, vol. 11, 1979, p. 139-148. 
  3. 3. L. BANAKOWSKI, A. KRECZMAR, G. MIRKOWSKA, H. RASIOWA et A. SALWICKI, An Introduction to Algorithmic Logic. Mathematical Investigations in the Theory of Programs, in Banach Center Publications V. 2 Mathematical Foundations of Computer Science, P. W. N. Polish Scientific Publishers, 1977, Warsaw, p. 7-99. Zbl0358.68035
  4. 4. J. W. DE BAKKER, Recursive Programs as Predicate Transformers, in Formal descriptions of programing concepts, E. J. NEUHOLD, éd., North-Holland, 1978, p. 165-202. Zbl0392.68006MR537905
  5. 5. CHANG KEISLER, Model Theory, N.-H. Amsterdam. Zbl0697.03022
  6. 6. S. A. COOK, Soundness and Completeness for an Axiom System for Program Verification, J.S.I.A.M. on Computing, vol. 7, 1978, p. 70-90. Zbl0374.68009MR495086
  7. 7. M. CLINT et C. A. R. HOARE, Program Proving: Jumps and Functions, Acta Informatica, vol. 1, 1972, p. 214-224. Zbl0229.68003
  8. 8. B. COURCELLE et M. NIVAT, The algebraic Semantics of Recursive Program Schemes, in Proc. 7th Math. Found of Comput. Sc. Symposium, 1978, Lecture Notes in Comput. Sc., vol. 62, p. 16-30. Zbl0384.68016MR519827
  9. 9. G. COUSINEAULes arbres à feuilles indicées : un cadre algébrique de définition des structures de contrôle, Thèse d'État, Paris, 1977. 
  10. 10. G. COUSINEAU, An algebraic definition of control structures, L.I.T.P. Report, 78-27 (à paraître dans Theor. Comp. Sci.). Zbl0456.68015
  11. 11. G. COUSINEAU, La programmation en EXEL, 1re partie; Revue Technique THOMSON-CSF, vol. 10, n°2, 1978, p. 209-234. 
  12. 12. G. COUSINEAU, La Programmation en EXEL, 2e partie, Revue Technique THOMSON-CSF, vol. 11, n° 1, 1979, p. 13-35. 
  13. 13. G. COUSINEAU et P. ENJALBERT, Program Equivalence and Provability, in Proc. 8th Math. Found. of Comput. Sc. Symposium, 1979, Lecture Notes in Comput. Sc., n° 74, p. 237-245. Zbl0404.68014
  14. 14. E. W. DIJSKRA, Guarded Commands, Non Determinacy and Formal Derivations of Programs, Corn. Assoc. comput. Math., vol. 18, n° 8, 1975, p. 453-457. Zbl0308.68017MR383808
  15. 15. DONER, Tree Acceptors and Some of their Applications, J. Comput. System Sci., vol. 4, 1970, p. 406-451. Zbl0212.02901MR287977
  16. 16. D. HAREL, Dynamic Logic, Springer Lecture Notes in Comput. Sc., vol. 68, 1979. Zbl0403.03024MR567695
  17. 17. D. HAREL, A. MEYER et V. R. PRATT, Computability and Completeness in Logics of Programs, Proc. 9th Annual A.C.M. Symposium on Theory of Computing, 1977, p. 261-268. MR495101
  18. 18. C. A. R. HOARE, An Axiomatic Basis for Computer Programing, Com. Assoc. Comput. Math., vol. 12, 1969, p. 576-580. Zbl0179.23105
  19. 19. C. A. R. HOARE et P. E. LAUER, Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, vol. 3, 1974, p. 135-153. Zbl0264.68006MR464644
  20. 20. S. IGARASHI, R. L. LONDON et D. C. LUCKMAN, Automatic Verification I..., Acta Informatica, vol. 4, 1975, p. 149-181. 
  21. 21. M. NIVAT, Chartes, arbres, Programmes itératifs, I.R.I.A.-S.E.S.O.R.I., Journées d'étude : Synthèse, Manipulation et transformation des programmes, 1978, p. 165-187. 
  22. 22. L. NOLIN et G. RUGGIU, A Formalization of EXEL, Assoc. Comput. Math. SIGACT-SIGPLAN Symposium on the Principle of Programming Languages, Boston, 1973. Zbl0308.68011
  23. 23. R. PARIKH, Second Order Process Logic, 19th I.E.E.E. Symposium on Found. of Computer Science, 1978. 
  24. 24. V. R. PRATT, Semantical Consideration on Floyd-Hoare Logic, 17th I.E.E.E. Symposium on Foundation of Computer Science, 1976, p. 109-121. MR502164
  25. 25. G. RUGGIU, De l'organigramme à la formule, Thèse d'État, Paris, 1973. 
  26. 26. M. WAND, A new Incompleteness Result for Hoare's System, J. Assoc. Comput Mach., vol. 25, 1978, p. 168-175. Zbl0364.68008MR474964

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.