Hoare logics for recursive procedures and unbounded nondeterminism

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

Volumn 2471, Issue , 2002, Pages 103-119

  Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HOARE LOGIC; ISABELLE; NON-DETERMINISM; PARAMETER-LESS; PARTIAL AND TOTAL CORRECTNESS; RECURSIVE PROCEDURE; SOUND AND COMPLETE; THEOREM PROVERS;

COMPUTER CIRCUITS;

EID: 84947780543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_8     Document Type: Conference Paper

References (25)

1. [1] Pierre America and Frank de Boer. Proving total correctness of recursive procedures. Information and Computation, 84:129–162, 1990.
2. [2] Krzysztof Apt. Ten Years of Hoare’s Logic: A Survey — Part I. ACM Trans. Programming Languages and Systems, 3(4):431–483, 1981.
3. [3] Krzysztof Apt. Ten Years of Hoare’s Logic: A Survey — Part II: Nondeterminism. Theoretical Computer Science, 28:83–109, 1984.
4. [4] Krzysztof Apt and Gordon Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33:724–767, 1986.
5. [5] Robert Cartwright and Derek Oppen. The logic of aliasing. Acta Informatica, 15:365–384, 1981.
6. [6] Gerald Arthur Gorelick. A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report 75, Dept. of Computer Science, Univ. of Toronto, 1975.
7. [7] Peter Hitchcock and David Park. Induction rules and termination proofs. In M. Nivat, editor, Automata, languages, and programming, pages 225–251. North Holland, 1973.
8. [8] C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:567–580,583, 1969.
9. [9] C.A.R. Hoare. Procedures and parameters: An axiomatic approach. In E. Engeler, editor, Semantics of algorithmic languages, volume 188 of Lecture Notes in Mathematics, pages 102–116. Springer-Verlag, 1971.
10. [10] Martin Hofmann. Semantik und Verifikation. Lecture notes, Universität Marburg. In German, 1997.
11. [11] Peter V. Homeier and David F. Martin. Mechanical verification of mutuallyrecursive procedures. In M.A. McRobbie and J. K. Slaney, editors, Automated Deduction— CADE-13, volume 1104 of Lect. Notes in Comp. Sci., pages 201–215. Springer-Verlag, 1996.
12. [12] Peter V. Homeier and David F. Martin. Mechanical verification of total correctness through diversion verification conditions. In J. Grundya nd M. Newey, editors, Theorem Proving in Higher Order Logics (TPHOLs’98), volume 1479 of Lect. Notes in Comp. Sci., pages 189–206. Springer-Verlag, 1998.
13. [13] Thomas Kleymann. Hoare logic and auxiliary variables. Formal Aspects of Computing, 11:541–566, 1999.
14. J. H. Morris. Comments on “procedures and parameters”. Undated and unpublished.
15. [15] David Naumann. Calculating sharp adaptation rules. Information Processing Letters, 77:201–208, 2000.
16. [16] Hanne Riis Nielson and Flemming Nielson. Semantics with Applications. Wiley, 1992.
17. [17] Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lect. Notes in Comp. Sci., pages 180–192. Springer-Verlag, 1996.
18. [18] Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing, 10:171–186, 1998.
19. [19] Tobias Nipkow, Lawrence Paulson, and Markus Wenzel. Isabelle/HOL — A Proof Assistant for Higher-Order Logic, volume 2283 of Lect. Notes inC omp. Sci. Springer-Verlag, 2002.
20. [20] David von Oheimb. Hoare logic for mutual recursion and local variables. In C. Pandu Rangan, V. Raman, and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 1738 of Lect. Notes inC omp. Sci., pages 168–180. Springer-Verlag, 1999.
21. [21] Ernst-Rüdiger Olderog. On the notion of expressiveness and the rule of adaptation. Theoretical Computer Science, 24:337–347, 1983.
22. [22] P. Pandya and M. Joseph. A structure-directed total correctness proof rule for recursive procedure calls. The Computer Journal, 29:531–537, 1986.
23. [23] Robert Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, Universityof Edinburgh, 1994.
24. [24] Thomas Schreiber. Auxiliaryv ariables and recursive procedures. In TAPSOFT’ 97: Theory and Practice of Software Development, volume 1214 of Lect. Notes in Comp. Sci., pages 697–711. Springer-Verlag, 1997.
25. [25] Stefan Soko Olowski. Total correctness for procedures. In Mathematical Foundations of Computer Science (MFCS), volume 53 of Lect. Notes in Comp. Sci., pages 475–483. Springer-Verlag, 1977.