Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic
Journal article, 2016

We present a fully abstract weakest precondition calculus and its integration with symbolic execution. Our assertion language allows both specifying and verifying properties of objects at the abstraction level of the programming language, abstracting from a specific implementation of object creation. Objects which are not (yet) created never play any role. The corresponding proof theory is discussed and justified formally by soundness theorems. The usage of the assertion language and proof rules is illustrated with an example of a linked list reachability property. All proof rules presented are fully implemented in a version of the KeY verification system for Java programs.

Program logic

Specification

Object creation

Dynamic logic

Verification

Author

S. De Gouw

Centrum voor Wiskunde en Informatica

SDL Fredhopper

F. De Boer

Centrum voor Wiskunde en Informatica

Leiden University

Wolfgang Ahrendt

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Richard Bubel

Technische Universität Darmstadt

Software and Systems Modeling

1619-1366 (ISSN) 1619-1374 (eISSN)

Vol. 15 4 1117-1140

Areas of Advance

Information and Communication Technology

Subject Categories

Computer Science

DOI

10.1007/s10270-014-0446-9

More information

Latest update

2/28/2018