How to cook a complete hoare logic for your pet oo language

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

Volumn 3188, Issue , 2004, Pages 111-133

  De Boer, Frank S ^a,b,c   Pierik, Gees ^c  

^a Centre of Mathematics and Computer Science   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS;

DYNAMIC BINDING; GENERAL METHODOLOGIES; HOARE LOGIC; NEW RESULTS; OBJECT-ORIENTED CONCEPTS; PROCEDURAL LANGUAGES; RECURSIVE PROCEDURE;

COMPUTATIONAL LINGUISTICS;

EID: 35048857338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30101-1_5     Document Type: Article

References (24)

1. M. Abadi and R. Leino. A logic of object-oriented programs. In M. Bidoit and M. Dauchet, editors, TAPSOFT '97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, volume 1214, pages 682-696. Springer-Verlag, 1997.
2. E. Abraham-Mumm, F. de Boer, W. de Roever, and M. Steffen. Verification for Java's reentrant multithreading concept. In Proc. of FoSSaCS 2002, volume 2303 of LNCS, pages 5-20, 2002.
3. K. R. Apt. Ten Years of Hoare's Logic: A Survey - Part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, October7 1981.
4. S. A. Cook. Soundness and completeness of an axiom system for program verification. Siam Journal of Computing, 7(1):70-90, February 1978.
5. J. de Bakker. Mathematical theory of program correctness. Prentice-Hall, 1980.
6. F. de Boer. Reasoning about dynamically evolving process structures. PhD thesis, Vrije Universiteit, 1991.
7. F. de Boer and C. Pierik. Computer-aided specification and verification of annotated object-oriented programs. In B. Jacobs and A. Rensink, editors, FMOODS V, pages 163-177. Kluwer Academic Publishers, 2002.
8. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
9. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI), pages 234-245, 2002.
10. R. W. Floyd. Assigning meaning to programs. In Proc. Symposium on Applied Mathematics, volume 19, pages 19-32. American Mathematical Society, 1967.
11. G. Gorelick. A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report 75, Dep. Computer Science, Univ. Toronto, 1975.
12. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. AddisonWesley, 1996.
13. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
14. T. Hoare. Assertions. In M. Broy and M. Pizka, editors, Models, Algebras and Logic of Engineering Software, volume 191 of NATO Science Series, pages 291-316. IOS Press, 2003.
15. A. Jeffrey and J. Rathke. A fully abstract may testing semantics for concurrent objects. In Proceedings of Logics in Computer Science, pages 101-112, 2002.
16. B. Meyer. Eiffel: The Language. Prentice-Hall, 1992.
17. T. Nipkow. Hoare logics for recursive procedures and unbounded nondeterminism. In J. Bradfield, editor, Computer Science Logic (CSL 2002), volume 2471 of LNCS, pages 103-119. Springer, 2002.
18. E.-R. Olderog and K. R. Apt. Fairness in parallel programs: The transformational approach. TOPLAS, 10(3):420-455, 1988.
19. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Ado. Informatica, 6:319-340, 1976.
20. C. Pierik and F. S. de Boer. A syntax-directed Hoare logic for object-oriented programming concepts. In E. Najm, U. Nestmann, and P. Stevens, editors, Formal Methods for Open Object-Based Distributed Systems (FMOODS) VI, volume 2884 of LNCS, pages 64-78, 2003.
21. C. Pierik and F. S. de Boer. A syntax-directed Hoare logic for object-oriented programming concepts. Technical Report UU-CS-2003-010, Institute of Information and Computing Sciences, Utrecht University, The Netherlands, March 2003. Available from http://www.cs.uu.nl/research/techreps/UU-CS-2003-010. html.
22. A. Poetzsch-Heffter and P. Müller. A programming logic for sequential Java. In S. D. Swierstra, editor, ESOP '99, volume 1576 of LNCS, pages 162-176, 1999.
23. J. Tucker and J. Zucker. Program correctness over abstract data types with errorstate semantics. North-Holland, 1988.
24. D. von Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience, 13(13):1173-1214, 2001.