Sciweavers

79 search results - page 13 / 16
» Whole Program Path-Based Dynamic Impact Analysis
Sort
View
SAC
1996
ACM
13 years 11 months ago
An enabling optimization for C++ virtual functions
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
Bradley M. Kuhn, David Binkley
ASPLOS
2012
ACM
12 years 3 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
IWMM
2010
Springer
125views Hardware» more  IWMM 2010»
13 years 9 months ago
Efficient memory shadowing for 64-bit architectures
Shadow memory is used by dynamic program analysis tools to store metadata for tracking properties of application memory. The efficiency of mapping between application memory and s...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
VLDB
2002
ACM
122views Database» more  VLDB 2002»
13 years 7 months ago
Lightweight Flexible Isolation for Language-based Extensible Systems
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...
Laurent Daynès, Grzegorz Czajkowski
ATAL
2008
Springer
13 years 9 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...