Results 1 -
5 of
5
Information Flow Analysis for Java Bytecode.
- In Proc. of the Sixth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI’05)
, 2005
"... ..."
(Show Context)
Type systems for optimizing stack-based code
- in Proc. of 2nd Wksh. on Bytecode Semantics, Verification, Analysis and Transformation, BYTECODE 2007, Vol. 190(1) of Electron. Notes in
, 2007
"... We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness proofs and strongest analysis (principal type inference) algorithms. Specifically, we treat dead store instructions, loa ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness proofs and strongest analysis (principal type inference) algorithms. Specifically, we treat dead store instructions, load-pop pairs, duplicating load instructions, store-load pairs. The load-pop pairs and store-load pairs elimination optimizations are built on top of bidirectional analyses, facilitating correct elimination of instruction pairs spanning across basic block boundaries. As a result, no assumptions are needed about input code (it need not be the compiled form of a high-level source program, the stack need not be empty at basic block boundaries and not even need it be checked for safety before the analysis). The soundness proofs and strongest analysis algorithms are simple and uniform.
Formalisation and Analysis of Dalvik BytecodeI
"... With the large, and rapidly increasing, number of smartphones based on the Android platform, combined with the open nature of the platform that allows “apps ” to be downloaded and executed on the smartphone, misbehaving and malicious (malware) apps are set to become a serious problem. To counter thi ..."
Abstract
- Add to MetaCart
With the large, and rapidly increasing, number of smartphones based on the Android platform, combined with the open nature of the platform that allows “apps ” to be downloaded and executed on the smartphone, misbehaving and malicious (malware) apps are set to become a serious problem. To counter this problem, automated tools for analysing and verifying apps are essential. Furthermore, to ensure high-fidelity of such tools, it is essential to formally specify both semantics and analyses. In this paper we present, to the best of our knowledge, the first formalisation of the complete Dalvik bytecode language including reflection features and the first formally specified control flow analysis for the language, including advanced control flow features such as dynamic dispatch, exceptions, and reflection. To determine which features to include in the formalisation and analysis, 1,700 Android apps from the Google Play app market (formerly known as Android Market) were downloaded and examined.
unknown title
"... Automated secure software protection through program externalization on memory-limited secure devices full version (draft)∗ ..."
Abstract
- Add to MetaCart
(Show Context)
Automated secure software protection through program externalization on memory-limited secure devices full version (draft)∗
