26 search results - page 3 / 6 » Termination Graphs for Java Bytecode |
150
Voted
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
108
Voted
TISSEC
2002
15 years 3 months ago
2002
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
153
click to vote
SCAM
2008
IEEE
15 years 10 months ago
2008
IEEE
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
148
Voted
CORR
2011
Springer
14 years 7 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 ...
143
click to vote
VL
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents a strategy for the visualization of dynamic object relationships in Java programs. The metaphor of a chemical molecule is used to aid comprehension, and to hel...