Hoare logic and auxiliary variables

Formal Aspects of Computing

Volumn 11, Issue 5, 1999, Pages 541-566

  Kleymann, Thomas ^a  

^a SD and M AG   (Germany)

Author keywords

Adaptation completeness; Auxiliary variables; Hoare logic; Most general formula; VDM

Indexed keywords

BIOMINERALIZATION;

ADAPTATION COMPLETENESS; AUXILIARY VARIABLES; GENERAL FORMULAS; HOARE LOGIC; VDM;

COMPUTER SOFTWARE REUSABILITY;

EID: 0041782440     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650050057     Document Type: Article

References (51)

1. Aczel, P.: A note on program verification. Unpublished, see also [Jon86], January 1982.
2. Aczel, P.: A system of proof rules for the correctness of iterative programs - some notational and organisational suggestions. Unpublished, August 1982.
3. America, P. and de Boer, F.: Proving total correctness of recursive procedures. Information and Computation, 84(2):129-162, 1990.
4. Abadi, M. and Leino, K. R. M.: A logic of object-oriented programs. In Bidoit and Dauchet [BiD97], pages 682-696.
5. Apt, K. R. and Meertens, L. G. L. T.: Completeness with finite systems of intermediate assertions for recursive program schemes. SIAM Journal on Computing, 9(4):665-671, November 1980.
6. Apt, K. R.: Ten years of Hoare's logic: A survey - part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, October 1981.
7. Bidoit, M. and Dauchet, M.: editors. Theory and Practice of Software Development. Proceedings of the 7th International Joint Conference of CAAP/FASE, TAPSOFT'97, volume 1214 of Lecture Notes in Computer Science, Lille, France, April 1997. Springer.
8. Burstall, R. and McKinna, J.: Deliverables: a categorical approach to program development in type theory. In Andrzej M. Borzyszkowski and Stefan Sokołowski, editors, Proceedings of MFCS '93, volume 711 of Lecture Notes in Computer Science, pages 32-67. Springer, September 1993. An earlier version appeared as LFCS technical report ECS-LFCS-92-242 in 1992.
9. Clarke, Jr. E. M.: Programming language constructs for which it is impossible to obtain good Hoare axiom systems. Journal of the ACM, 26(1):129-147, January 1979.
10. Clint, M.: On the use of history variables. Acta Informatica, 16:15-30, 1981.
11. Cook, S. A.: Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70-90, February 1978.
12. Cousot, P.: 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.
13. Dahl, O.-J.: Verifiable Programming. International Series in Computer Science. Prentice Hall, 1992.
14. de Bakker, J.: Mathematical Theory of Program Correctness. Prentice Hall, 1980.
15. Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings. Communications of the ACM, 22(8):465-475, August 1979.
16. Floyd, R. W.: Assigning meanings to programs. In J. T. Schwartz, editor, Proc. Symp. in Applied Mathematics, volume 19, pages 19-32, 1967.
17. Gries, D. and Levin, G.: Assignment and procedure call proof rules. ACM Transactions on Programming Languages and Systems, 2(4):564-579, 1980.
18. Gorelick, G. A.: A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report 75, Department of Computer Science, University of Toronto, 1975.
19. Gries, D.: The Science of Computer Programming. Springer, 1981.
20. Halpern, J. Y.: A good Hoare axiom system for an Algol-like language. In Eleventh Annual Symposium on Principles of Programming Languages (POPL) (Salt Lake City, UT), pages 262-271. ACM, January 15-18, 1984.
21. Hoare, C. A. R. and Jones, C. B.: editors. Essays in Computing Science. International Series in Computer Science. Prentice Hall, 1989.
22. Homeier, P. V. and Martin, D. V.: Mechanical verification of mutually recursive procedures. In M. A. McRobbie and J. K. Slaney, editors, Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence, pages 201-215, New Brunswick, NJ, USA, July/August 1996. Springer. 13th International Conference on Automated Deduction.
23. Hoare, C. A. R.: An axiomatic basis for computer programming. Communications of the ACM, 12:576-580, 1969. Also in [HoJ89].
24. Hoare, C. A. R.: 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 [HoJ89].
25. Hoare, C. A. R.: Parallel programming: An axiomatic approach. Computer Languages, 1(2):151-160, 1975. Also in [HoJ89].
26. Hofmann, M.: Semantik und Verifikation, 1997. Lecture Notes for a course held in Winter term 1997/98 at the University of Marburg. In German.
27. Jones, C. B.: Systematic program development. In N. Gehani and A. MacGettrick, editors, Software Specification Techniques, pages 89-109. Addison-Wesley, 1586.
28. Jones, C. B.: Systematic Software Development Using VDM. International Series in Computer Science. Prentice Hall, 2 edition, 1990.
29. Jones, C. B. and Shaw, R. C. F.: Case Studies in Systematic Software Development. Prentice Hall, 1990.
30. Kleymann, T.: Hoare Logic and VDM: Machine-checked soundness and completeness proofs. PhD thesis ECS-LFCS-98-392, Laboratory for Foundations of Computer Science, University of Edinburgh, September 1998.
31. Kleymann, T: Metatheory of verification calculi in LEGO - to what extent does syntax matter? In Thorsten Altenkirch, Wolfgang Naraschewski, and Bernhard Reus, editors, Types for Proofs and Programs, volume 1657 of Lecture Notes in Computer Science. Springer, August 1999. An earlier version appeared as LFCS report ECS-LFCS-98-393.
32. London, R. L., Guttag, J. V., Horning, J. J., Lampson, B. W., Mitchell, J. G. and Popek, G. J.: Proof rules for the programming language Euclid. Acta Informatica, 10:1-26, 1978.
33. Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
34. Morris, J. H.: Comments on "procedures and parameters". Undated and unpublished.
35. Morgan, C. C.: Procedures, parameters, and abstraction: separate concerns. Science of Computer Programming, 11:17-27, 1988.
36. Morgan, C. C.: Programming from Specifications. Prentice: Hall, 1990.
37. Nipkow, T.: Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing, 10:171-186, 1998.
38. Owicki, S. and Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica, 6(4):319-340, 1976.
39. Olderog, E.-R.: Sound and complete Hoare-like calculi based on copy rules. Acta Informatica, 16:161-197, 1981.
40. Olderog, E.-R.: On the notion of expressiveness and the rule of adaptation. Theoretical Computer Science, 24:337-347, 1983.
41. Pollack, R.: The Theory of LEGO, A Proof Checker for the Extended Calculus of Constructions. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1994.
42. Reynolds, J. C.: Idealized Algol and its specification logic. In D. Neel, editor, Tools & Notions for Program Construction. Cambridge University Press, 1982.
43. Schreiber, T.: Auxiliary variables and recursive procedures. In Bidoit and Dauchet [BiD97], pages 697-711.
44. Sokołowski, S.: Total correctness for procedures. In J. Gruska, editor, Sixth Mathematical Foundations of Computer Science (Tatranská Lomnica), volume 53 of Lecture Notes in Computer Science, pages 475-483. Springer, 1977.
45. Soundararajan, N.: A proof technique for parallel programs. Theoretical Computer Science, 31:13-29, 1984.
46. Stirling, C.: A generalization of Owicki-Gries's Hoare Logic for a concurrent while language. Theoretical Computer Science, 58:347-359, 1988.
47. Stølen, K.: A method for the development of totally correct shared-state parallel programs. In Jos C. M. Baeten and Jan Friso Groote, editors. Proceedings of CONCUR '91, volume 527 of Lecture Notes in Computer Science, pages 510-525. Springer, 1991.
48. Tarlecki, A.: A language of specified programs. Science of Computer Programming, 5:59-81, 1985.
49. Vickers, S.: Formal implementation. In John A. McDermid, editor, Software engineer's reference book, chapter 25. Butterworth-Heinemann, London, 1991.
50. von Oheimb, D.: Hoare logic for mutual recursion and local variables. In Nineteenth Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Chennai, India, December 1999. Springer. To appear.
51. Zwiers, J.: Compositionality, Concurrency and Partial Correctness, volume 321 of Lecture Notes in Computer Science. Springer, 1989.