Sciweavers

378 search results - page 22 / 76
» Automation of Java Code Analysis for Programming Exercises
Sort
View
POPL
2008
ACM
14 years 8 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
COMCOM
2000
125views more  COMCOM 2000»
13 years 7 months ago
On object initialization in the Java bytecode
Java is an ideal platform for implementing mobile code systems, not only because of its portability but also because it is designed with security in mind. Untrusted Java programs ...
Stephane Doyon, Mourad Debbabi
EPIA
2003
Springer
14 years 27 days ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
IPPS
2005
IEEE
14 years 1 months ago
Automated Analysis of Memory Access Behavior
Abstract— We developed an automated environment to measure the memory access behavior of applications on high performance clusters. Code optimization for processor caches is cruc...
Michael Gerndt, Tianchao Li
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink