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.


Wolfgang Ahrendt

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

F. De Boer

Stichting Centrum voor Wiskunde & Informatica (CWI)

Immo Grabe

Christian-Albrechts-Universität zu Kiel

Stichting Centrum voor Wiskunde & Informatica (CWI)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 5850 612 - 627
978-3-642-05088-6 (ISBN)


Datavetenskap (datalogi)





Mer information

Senast uppdaterat