Sciweavers

9626 search results - page 1545 / 1926
» Invariant Based Programming
Sort
View
LCTRTS
2007
Springer
16 years 28 days ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
16 years 25 days ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...
ISPASS
2006
IEEE
16 years 24 days ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
MICRO
2006
IEEE
117views Hardware» more  MICRO 2006»
16 years 24 days ago
PathExpander: Architectural Support for Increasing the Path Coverage of Dynamic Bug Detection
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
Shan Lu, Pin Zhou, Wei Liu, Yuanyuan Zhou, Josep T...
ISSTA
2006
ACM
16 years 22 days ago
Test input generation for java containers using state matching
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
Willem Visser, Corina S. Pasareanu, Radek Pel&aacu...
« Prev « First page 1545 / 1926 Last » Next »