A proof outline logic for object-oriented programming

@article{Pierik2005APO,
  title={A proof outline logic for object-oriented programming},
  author={Cees Pierik and Frank S. de Boer},
  journal={Theor. Comput. Sci.},
  year={2005},
  volume={343},
  pages={413-442}
}
This paper describes a proof outline logic that covers most typical object-oriented language constructs in the presence of inheritance and subtyping. The logic is based on a weakest precondition calculus for assignments and object allocation which takes field shadowing into account. Dynamically bound method calls are tackled with a variant of Hoare’s rule of adaptation that deals with the dynamic allocation of objects in object-oriented programs. The logic is based on an assertion language that… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

F

  • C. Pierik
  • S. de Boer, Modularity and the rule of adaptation…
  • 2004
Highly Influential
3 Excerpts

F

  • C. Pierik, D. Clarke
  • S. de Boer, Creational invariants, in: Proc. of…
  • 2004

Similar Papers

Loading similar papers…