Hoare logic for NanoJava: Auxiliary variables, side effects, and virtual methods revisited

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

Volumn 2391, Issue , 2002, Pages 89-105

  von Oheimb, David ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Auxiliary variables; Dynamic binding; Hoare logic; Isabelle HOL; Java; Side effects

Indexed keywords

FORMAL METHODS; JAVA PROGRAMMING LANGUAGE;

AUXILIARY VARIABLES; DYNAMIC BINDING; HOARE LOGIC; ISABELLE/HOL; JAVA; SIDE EFFECT;

COMPUTER CIRCUITS;

EID: 84937406744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45614-7_6     Document Type: Conference Paper

References (24)

1. M. Abadi and K. R. M. Leino. A logic of object-oriented programs. In Theory and Practice of Software Development, volume 1214 of Lect. Notes in Comp. Sci., pages 682–696. Springer-Verlag, 1997.
2. P. America and F. de Boer. Provingtotal correctness of recursive procedures. Information and Computation, 84:129–162, 1990.
3. K. R. Apt. Ten years of Hoare logic: A survey—part I. ACM Trans. on Prog. Languages and Systems, 3:431–483, 1981.
4. S. A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70–90, 1978.
5. G. A. Gorelick. A complete axiomatic system for provingassertions about recursive and non-recursive programs. Technical Report 75, Department of Computer Science, University of Toronto, 1975.
6. M. Huisman. Java program verification in Higher-order logic with PVS and Isabelle. PhD thesis, University of Nijmegen, 2001.
7. M. Huisman and B. Jacobs. Java program verification via a Hoare logic with abrupt termination. In Fundamental Approaches to Software Engineering, volume 1783 of Lect. Notes in Comp. Sci., pages 284–303. Springer-Verlag, 2000.
8. A. Igarashi, B. Pierce, and P. Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA), Oct. 1999. Full version in ACM Transactions on Programming Languages and Systems (TOPLAS), 2001.
9. B. Jacobs and E. Poll. A logic for the Java Modeling Language JML. In H. Hussmann, editor, Fundamental Approaches to Software Engineering, volume 2029 of Lect. Notes in Comp. Sci., pages 284–299. Springer-Verlag, 2001.
10. T. Kleymann. Hoare logic and VDM: Machine-checked soundness and completeness proofs. Ph. D. Thesis, ECS-LFCS-98-392, LFCS, 1998.
11. T. Kleymann. Hoare logic and auxiliary variables. Formal Aspects of Computing, 11:541–566, 1999.
12. T. Kowaltowski. Axiomatic approach to side effects and general jumps. Acta Informatica, 7:357–360, 1977.
13. K. R. M. Leino. Ecstatic: An object-oriented programming language with an axiomatic semantics. In Fourth International Workshop on Foundations of Object-Oriented Programming (FOOL 4), 1997.
14. J. Morris. Comments on “procedures and parameters”. Undated and unpublished.
15. T. 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.
16. T. Nipkow. Hoare logics for recursive procedures and unbounded nondeterminism. Draft, 2001.
17. T. Nipkow. Hoare logics in Isabelle/HOL. In Proof and System-Reliability, 2002.
18. T. Nipkow, D. v. Oheimb, and C. Pusch. μJava: Embeddinga programminglanguage in a theorem prover. In F. Bauer and R. Steinbrüggen, editors, Foundations of Secure Computation, pages 117–144. IOS Press, 2000. http://isabelle.in.tum.de/Bali/papers/MOD99.html.
19. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL—A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002. http://www4.in.tum.de/˜nipkow/LNCS2283/.
20. D. V. Oheimb. Hoare logic for mutual recursion and local variables. In C. P. Rangan, V. Raman, and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lect. Notes in Comp. Sci., pages 168–180. Springer-Verlag, 1999. http://isabelle.in.tum.de/Bali/papers/FSTTCS99.html.
21. D. V. Oheimb. Analyzing Java in Isabelle/HOL: Formalization, Type Safety and Hoare Logic. PhD thesis, Technische Universität München, 2001. http://www4.in.tum.de/˜oheimb/diss/.
22. D. V. Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience, 13(13), 2001. http://isabelle.in.tum.de/Bali/papers/CPE01.html.
23. A. Poetzsch-Heffter. Personal communication, Aug. 2001.
24. A. Poetzsch-Heffter and P. Müller. A programming logic for sequential Java. In S. Swierstra, editor, Programming Languages and Systems (ESOP’99), volume 1576 of Lect. Notes in Comp. Sci., pages 162–176. Springer-Verlag, 1999.