Sciweavers

26 search results - page 2 / 6
» Experiments in Cost Analysis of Java Bytecode
Sort
View
ECOOP
2008
Springer
13 years 7 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
RTA
2011
Springer
12 years 8 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
FOAL
2007
ACM
13 years 9 months ago
On bytecode slicing and aspectJ interferences
AspectJ aims at managing tangled concerns in Java systems. Crosscutting aspect definitions are woven into the Java bytecode at compile-time. Whether the better modularization intr...
Antonio Castaldo D'Ursi, Luca Cavallaro, Mattia Mo...
SEFM
2005
IEEE
13 years 11 months ago
Precise Analysis of Memory Consumption using Program Logics
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
Gilles Barthe, Mariela Pavlova, Gerardo Schneider
POS
1998
Springer
13 years 9 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...