1794 search results - page 263 / 359 » Visualizing Memory Graphs |
103
Voted
ISW
2004
Springer
15 years 7 months ago
2004
Springer
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a si...
86
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
108
click to vote
VLSID
2000
IEEE
15 years 6 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
ISSTA
2000
ACM
15 years 6 months ago
2000
ACM
This paper presents a strategy for structural testing of objectoriented software systems with possibly unknown clients and unknown information about invoked methods. By exploiting...
ICCAD
1997
IEEE
15 years 6 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...