Sciweavers

1407 search results - page 149 / 282
» The Use of Overloading in Java Programs
Sort
View
ECOOP
2009
Springer
16 years 3 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
NORDICHI
2004
ACM
15 years 8 months ago
Visual attention tracking during program debugging
This paper reports on a study which compared two tools for tracking the focus of visual attention - a remote eye tracker and the Restricted Focus Viewer (RFV). The RFV tool blurs ...
Roman Bednarik, Markku Tukiainen
ICDCS
2002
IEEE
15 years 8 months ago
OS Support for P2P Programming: a Case for TPS
Just like Remote Procedure Call (RPC) turned out to be a very effective OS abstraction in building client-server applications over LANs, Type-based Publish-SubTPS) can be viewed a...
Sébastien Baehni, Patrick Th. Eugster, Rach...
PPDP
2004
Springer
15 years 8 months ago
JIAD: a tool to infer design patterns in refactoring
Refactoring in object-orientation has gained increased attention due to its ability to improve design quality. Refactoring using design patterns (DPs) leads to production of high ...
J. Rajesh, D. Janakiram
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 3 months ago
The Santa Claus problem
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
Nikhil Bansal, Maxim Sviridenko