Sciweavers

1376 search results - page 271 / 276
» Monitoring Software Requirements Using Instrumented Code
Sort
View
CASES
2006
ACM
14 years 1 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
MOBISYS
2008
ACM
14 years 7 months ago
Flashproxy: transparently enabling rich web content via remote execution
It is now common for Web sites to use active Web content, such as Flash, Silverlight, or Java applets, to support rich, interactive applications. For many mobile devices, however,...
Alexander Moshchuk, Steven D. Gribble, Henry M. Le...
IISWC
2009
IEEE
14 years 2 months ago
On the (dis)similarity of transactional memory workloads
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...
Clay Hughes, James Poe, Amer Qouneh, Tao Li
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 2 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers