Sciweavers

2527 search results - page 213 / 506
» Aging in language dynamics
Sort
View
SIGSOFT
2006
ACM
16 years 7 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
JFP
2008
72views more  JFP 2008»
15 years 6 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
ICS
2007
Tsinghua U.
16 years 21 days ago
Performance driven data cache prefetching in a dynamic software optimization system
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
Jean Christophe Beyler, Philippe Clauss
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PASTE
2010
ACM
15 years 10 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund