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.
Gouw, S. D., Boer, F. S. D., Ahrendt, W., & Bubel, R. (2016). Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic. Software and System Modeling, 15(4), 1117-1140. https://doi.org/10.1007/s10270-014-0446-9