Abstract Interpretation of Symbolic Execution with Explicit State Updates

Authors:
Richard Bubel;Reiner Hähnle;Benjamin Weiß
Affiliations:
Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University,;Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University,;Institute for Theoretical Computer Science, University of Karlsruhe,
Venue:
Formal Methods for Components and Objects
Year:
2009

Citing 0
Cited 3

Interleaving symbolic execution and partial evaluation

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Verification of information flow properties of java programs without approximations

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Engineering virtualized services

Proceedings of the Second Nordic Symposium on Cloud Computing & Internet Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Systems for deductive software verification model the semantics of their target programming language with full precision. On the other hand, abstraction based approaches work with approximations of the semantics in order to be fully automatic. In this paper we aim at providing a uniform framework for both fully precise and approximate reasoning about programs. We present a sound dynamic logic calculus that integrates abstraction in the sense of abstract interpretation theory. In the second part of the paper, we apply the approach to the analysis of secure information flow.