Auxiliary variables and recursive procedures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 698-711

  Schreiber, Thomas ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; SEMANTICS;

AUXILIARY VARIABLES; AXIOMATIC SEMANTICS; COMPUTER-AIDED PROOFS; CONSEQUENCE RULES; IMPERATIVE PROGRAMS; RECURSIVE PROCEDURE; RULE OF ADAPTATION; SOUND AND COMPLETE;

SOFTWARE DESIGN;

EID: 84957000459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030635     Document Type: Conference Paper

References (20)

1. Peter Aczel. A system of proof rules for the correctness of iterative programs - some notational and organisational suggestions. Unpublished, August 1982.
2. Pierre America and Frank de Boer. Proving total correctness of recursive procedures. Information and Computation, 84(2):129-162, 1990.
3. Krzysztof R. Apt. Ten years of Hoare's logic: A survey - part I. ACId Transactions on Programming Languages and Systems, 3(4):431-483, October 1981.
4. Krzysztof R. Apt and Lambert G. L. T. Meertens. Completeness with finite systems of intermediate assertions for recursive program schemes. SIAM Journal on Computing, 9(4):665-671, November 1980.
5. Stephen A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70-90, February 1978.
6. P. Cousot. Methods and logics for proving programs. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 15, pages 841-993. Elsevier, 1990.
7. Ole-Johan Dahl. Verifiable Programming. International Series in Computer Scienceo Prentice Hall, 1992.
8. R.W. Floyd. Assigning meanings to programs. In J. T. Schwartz, editor, Proc. Syrup. in Applied Mathematics, volume 199 pages 19-32, 1967.
9. Michael J.C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwhistle and P.A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving (Banff, Alberta), number 15 in Workshops in Computing, pages 387-439. Springer, 1991.
10. David Cries. The Science of Computer Programming, chapter 16, pages 193-215. Springer, 1981.
11. D. Harel. First-order Dynamic Logic, volume 68 of Lecture Notes in Computer Science. Springer, 1979.
12. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:576-580, 1969. Also in [14].
13. C.A.R. Hoaxe. Procedures and parameters: An axiomatic approach. In E. Engeler editor, Symposium on Semantics of Algorithmic Languages, volume 188 of Lecture Notes in Mathematics, pages 102-116. Springer, 1971. Also in 114].
14. C.A.R. Hoare and Cliff B. Jones, editors. Essays in Computing Science. International Series in Computer Science. Prentice Hall, 1989.
15. Cliff Bo Jones. Systematic Software Development Using VDM. International Series in Computer Science. Prentice Hall, 2 edition, 1999.
16. The Lego World Wide Web page. http://www.dcs.ed.ac.u.k/home/lego.
17. James H. Morris. Comments on "procedures and parameters". Undated and unpublished.
18. Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru and V. Vinay, editors, Proceedings of 16th Conference on Foundations of Software Technology and Theoretical Computer Science (Hyderabad, India, December 18-20, 1996), volume 1180 of Lecture Notes in Computer Science, pages 180-192. Springer, 1996.
19. Ernst-Riidiger Olderog. On the notion of expressiveness and the rule of adaptation. Theoretical Computer Science, 24:337-347, 1983.
20. Stefan Sokotowski. Total correctness for procedures. In J. Gruska, editor, Sixth Mathematical Foundations of Computer Science (Tatranskd Lomnica), volume 53 of Lecture Notes in Computer Science, pages 475-483. Springer, 1977.