Sciweavers

725 search results - page 46 / 145
» Escape Analysis for Java
Sort
View
ECLIPSE
2005
ACM
13 years 10 months ago
Building a whole-program type analysis in Eclipse
Eclipse has the potential to become a widely-used platform for implementation and dissemination of various static analyses for Java. In order to realize this potential, it is impo...
Mariana Sharp, Jason Sawin, Atanas Rountev
POPL
2008
ACM
14 years 9 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
EMNLP
2006
13 years 10 months ago
Context-Dependent Term Relations for Information Retrieval
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related w...
Jing Bai, Jian-Yun Nie, Guihong Cao
ICSE
2009
IEEE-ACM
14 years 9 months ago
Modular string-sensitive permission analysis with demand-driven precision
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. W...
Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Ba...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 9 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