A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic
2014
Journal of Software and Systems Modeling
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
doi:10.1007/s10270-014-0446-9
fatcat:rubrratjnfaplhxyylt2cyf4gm