Sciweavers

4469 search results - page 488 / 894
» Dynamic Program Slicing
Sort
View
POPL
2010
ACM
16 years 4 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
OOPSLA
2004
Springer
16 years 6 days ago
AJEER: an aspectJ-enabled eclipse runtime
There are a number of technologies designed to improve modularity in software systems. The technique presented here combines two of them seamlessly to exploit their respective ben...
Martin Lippert
PASTE
2010
ACM
15 years 12 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
PLDI
1999
ACM
15 years 11 months ago
Load-Reuse Analysis: Design and Evaluation
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
Rastislav Bodík, Rajiv Gupta, Mary Lou Soff...
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 10 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...