Abstract Object Creation in Dynamic Logic

Authors:
Wolfgang Ahrendt;Frank S. Boer;Immo Grabe
Affiliations:
Chalmers University, Göteborg, Sweden;CWI, Amsterdam, The Netherlands;CWI, Amsterdam, The Netherlands and Christian-Albrechts-University Kiel, Germany
Venue:
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Year:
2009

Citing 10
Cited 3

JML (poster session): notations and tools supporting detailed design in Java

OOPSLA '00 Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum)
The LOOP Compiler for Java and JML

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Logic of Object-Oriented Programs

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A WP-calculus for OO

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A machine-checked model for a Java-like language, virtual machine, and compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)
Generating unit tests from formal proofs

TAP'07 Proceedings of the 1st international conference on Tests and proofs
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
Sequential, parallel, and quantified updates of first-order structures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dynamic logic with non-rigid functions: a basis for object-oriented program verification

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Simulating reachability using first-order logic with applications to verification of linked data structures

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

A Verification System for Distributed Objects with Asynchronous Method Calls

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A system for compositional verification of asynchronous objects

Science of Computer Programming
True small-step reduction for imperative object oriented languages

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a representation of a weakest precondition calculus for abstract object creation in dynamic logic, the logic underlying the KeY theorem prover. This representation allows to both specify and verify properties of objects at the abstraction level of the (object-oriented) programming language. Objects which are not (yet) created never play any role, neither in the specification nor in the verification of properties. Further, we show how to symbolically execute abstract object creation.