Sciweavers

1392 search results - page 5 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
SIGSOFT
2008
ACM
15 years 10 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
189
Voted

Book
407views
16 years 5 months ago
Java Gently
"Java Gently teaches the reader how to program and how to do it in the best possible style in Java. In the process, it details the fundamental structures of the Java 2 languag...
Judy Bishop
CGO
2008
IEEE
15 years 4 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
TGC
2010
Springer
14 years 7 months ago
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
David Aspinall, Robert Atkey, Kenneth MacKenzie, D...
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
15 years 4 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...