Verification of object-oriented programs: A transformational approach

Authors:
Krzysztof R. Apt;Frank S. de Boer;Ernst-Rüdiger Olderog;Stijn de Gouw
Affiliations:
Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands and University of Amsterdam, Institute of Language, Logic and Computation, Amsterdam, The Netherlands;Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands and Leiden Institute of Advanced Computer Science, University of Leiden, The Netherlands;Department of Computing Science, University of Oldenburg, Germany;Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands and Leiden Institute of Advanced Computer Science, University of Leiden, The Netherlands
Venue:
Journal of Computer and System Sciences
Year:
2012

Citing 18
Cited 2

Program correctness over abstract data types, with error-state semantics

Program correctness over abstract data types, with error-state semantics
Proving total correctness of recursive procedures

Information and Computation
Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

Journal of the ACM (JACM)
A Proof System for Communicating Sequential Processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
Java Program Verification via a Hoare Logic with Abrupt Termination

FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely Expressions

Proceedings of the 7th Colloquium on Automata, Languages and Programming
An overview of JML tools and applications

International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
Ownership confinement ensures representation independence for object-oriented programs

Journal of the ACM (JACM)
A proof outline logic for object-oriented programming

Theoretical Computer Science - Formal methods for components and objects
A machine-checked model for a Java-like language, virtual machine, and compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modular invariants for layered object structures

Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Verification of Sequential and Concurrent Programs

Verification of Sequential and Concurrent Programs
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

Local Reasoning for Global Invariants, Part II: Dynamic Boundaries

Journal of the ACM (JACM)
Local Reasoning for Global Invariants, Part I: Region Logic

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that verification of object-oriented programs by means of the assertional method can be achieved in a simple way by exploiting a syntax-directed transformation from object-oriented programs to recursive programs. This transformation suggests natural proofs rules and its correctness helps us to establish soundness and relative completeness of the proposed proof system. One of the difficulties is how to properly deal in the assertion language with the instance variables and aliasing. The discussed programming language supports arrays, instance variables, failures and recursive methods with parameters. We also explain how the transformational approach can be extended to deal with other features of object-oriented programming, like classes, inheritance, subtyping and dynamic binding.