Sciweavers

1291 search results - page 137 / 259
» Arithmetic program paths
Sort
View
PLDI
2009
ACM
14 years 4 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
SPAA
2003
ACM
14 years 3 months ago
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
When using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his c...
Géraud Krawezik
JSA
2000
175views more  JSA 2000»
13 years 9 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
ROBOCOMM
2007
IEEE
14 years 4 months ago
Distributed control diffusion: towards a flexible programming paradigm for modular robots
—A self-reconfigurable robot is a robotic device that can change its own shape. Self-reconfigurable robots are commonly built from multiple identical modules that can manipulat...
Ulrik Pagh Schultz
SP
2010
IEEE
194views Security Privacy» more  SP 2010»
14 years 1 months ago
Identifying Dormant Functionality in Malware Programs
—To handle the growing flood of malware, security vendors and analysts rely on tools that automatically identify and analyze malicious code. Current systems for automated malwar...
Paolo Milani Comparetti, Guido Salvaneschi, Engin ...