Sciweavers

Share
3 search results - page 1 / 1
» Decomposing bytecode verification by abstract interpretation
Sort
View
TOPLAS
2008
138views more  TOPLAS 2008»
11 years 5 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
CC
2008
Springer
137views System Software» more  CC 2008»
11 years 7 months 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...
Francesco Logozzo, Manuel Fähndrich
POPL
2008
ACM
12 years 5 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
books