635 search results - page 12 / 127 » Path Optimization in Programs and Its Application to Debuggi... |
SIGMETRICS
1992
ACM
15 years 1 months ago
1992
ACM
To cope with the increasing difference between processor and main memory speeds, modern computer systems use deep memory hierarchies. In the presence of such hierarchies, the perf...
92
Voted
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
184
Voted
POPL
2007
ACM
15 years 9 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
ENTCS
2007
14 years 9 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
112
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...