Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic

Abstract

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.Communicated by Prof. Einar Broch Johnsen and Luigia Petre.

Footprint Logic for Object-Oriented Components

“…Using results from the paper [8], on the verification of object-oriented programs with classes and abstract object creation (but without footprints), the logic in this paper can be further extended in a straightforward manner to cover nearly the entire sequential subset of Java, including other failures and exceptions generated by other language features. That paper also showed how to mechanize proof rules for abstract object creation in the KeY system.…”

SymPaths: Symbolic Execution Meets Partial Order Reduction

“…Such an explicit heap variable introduces a mismatch between the abstraction level of the programming language and its symbolic execution. On the other hand, in [18] we already formalized symbolic execution for abstract object creation in dynamic logic which, as in [8], does not involve an explicit heap variable. As such this formalization provides a promising basis for further extensions to object-oriented multithreaded programs, using the partial order reduction techniques as described in this paper.…”