Sciweavers

Share
CC
2008
Springer

On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis

9 years 2 days ago
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings many simplifications, e.g., fewer cases, independence from source syntax, name resolution, etc., it also introduces precision loss that must be recovered either via preprocesse precise abstract domains, more precise transfer functions, or a combination thereof. The paper studies the relative completeness of a static analysis for bytecode compared to the analysis of the program source. We illustrate it through examples originating from the design and the implementation ot, a generic static analyzer based on Abstract Interpretation for the analysis of MSIL.
Francesco Logozzo, Manuel Fähndrich
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CC
Authors Francesco Logozzo, Manuel Fähndrich
Comments (0)
books