Sciweavers

22 search results - page 3 / 5
» Analysis and Development of Java Grande Benchmarks
Sort
View
OOPSLA
1999
Springer
13 years 11 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
ASPLOS
2004
ACM
14 years 26 days ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
POPL
2008
ACM
14 years 7 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
HIPEAC
2011
Springer
12 years 7 months ago
TypeCastor: demystify dynamic typing of JavaScript applications
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
Shisheng Li, Buqi Cheng, Xiao-Feng Li
TSE
2011
165views more  TSE 2011»
13 years 2 months ago
Bristlecone: Language Support for Robust Software Applications
— We present Bristlecone, a programming language for robust software systems. Bristlecone applications have two components: a high-level organization specification that describe...
Brian Demsky, Sivaji Sundaramurthy