83 search results - page 2 / 17 » Termination Analysis of Java Bytecode |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
BIRTHDAY
2010
Springer
13 years 2 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
VMCAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic di...
COMPSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
Understanding program dependencies in a computer program is essential for many software engineering tasks such as program understanding, testing, debugging, reverse engineering, a...