Sciweavers

484 search results - page 8 / 97
» Caching function calls using precise dependencies
Sort
View
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
JSA
2000
175views more  JSA 2000»
13 years 7 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
FQAS
2006
Springer
186views Database» more  FQAS 2006»
13 years 11 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
HPCA
1998
IEEE
13 years 11 months ago
Speculative Versioning Cache
Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous ...
Sridhar Gopal, T. N. Vijaykumar, James E. Smith, G...
LCPC
1999
Springer
13 years 11 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu