Sciweavers

308 search results - page 23 / 62
» Symbolic execution of data paths
Sort
View
JSA
2000
175views more  JSA 2000»
13 years 8 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
AGENTS
1998
Springer
14 years 25 days ago
Learning Situation-Dependent Costs: Improving Planning from Probabilistic Robot Execution
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
Karen Zita Haigh, Manuela M. Veloso
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
14 years 25 days ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
VLDB
2005
ACM
123views Database» more  VLDB 2005»
14 years 8 months ago
Querying XML streams
Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which acce...
Vanja Josifovski, Marcus Fontoura, Attila Barta
ISORC
2011
IEEE
13 years 9 days ago
A Time-Predictable Object Cache
—Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is...
Martin Schoeberl