A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts

  • Cees Pierik
  • Frank S. de Boer
Conference paper

DOI: 10.1007/978-3-540-39958-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2884)
Cite this paper as:
Pierik C., de Boer F.S. (2003) A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts. In: Najm E., Nestmann U., Stevens P. (eds) Formal Methods for Open Object-Based Distributed Systems. FMOODS 2003. Lecture Notes in Computer Science, vol 2884. Springer, Berlin, Heidelberg

Abstract

This paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculus for assignments and object-creation, as well as Hoare rules for reasoning about (mutually recursive) method invocations with dynamic binding. Our approach enables reasoning at an abstraction level that coincides with the general abstraction level of object-oriented languages.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2003

Authors and Affiliations

  • Cees Pierik
    • 1
  • Frank S. de Boer
    • 1
    • 2
  1. 1.Institute of Information and Computing SciencesUtrecht UniversityThe Netherlands
  2. 2.CWIAmsterdamThe Netherlands

Personalised recommendations