Abstract
In this chapter, we present a framework to integrate abstract interpretation into JavaDL. Our abstraction does not act directly on target programs, but on their symbolic state representation (JavaDL's updates). Unlike counter example guided abstraction-refinement (CEGAR) loops, we start with a fully precise representation and use abstraction only incrementally on demand, for example, to enforce termination of symbolic execution of a loop. Incremental means two things: use abstractions that are not coarser than necessary and apply abstraction to as few program locations as possible. This allows us to become fully-automatic, as for instance, no loop invariants need to be provided, but to maintain high precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Wasser, N., Hähnle, R., Bubel, R. (2016). Abstract Interpretation. In: Ahrendt, W., Beckert, B., Bubel, R., Hähnle, R., Schmitt, P., Ulbrich, M. (eds) Deductive Software Verification – The KeY Book. Lecture Notes in Computer Science(), vol 10001. Springer, Cham. https://doi.org/10.1007/978-3-319-49812-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-49812-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49811-9
Online ISBN: 978-3-319-49812-6
eBook Packages: Computer ScienceComputer Science (R0)