Abstract Object Creation in Dynamic Logic - To Be or Not To Be Created
Paper i proceeding, 2009

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.

Författare

Wolfgang Ahrendt

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

F. De Boer

Centrum voor Wiskunde en Informatica

Immo Grabe

Centrum voor Wiskunde en Informatica

Christian-Albrechts-Universität zu Kiel

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 5850 612 - 627

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-05089-3_39

ISBN

978-3-642-05088-6