104 search results - page 6 / 21 » Dependency trees in sub-linear time and bounded memory |
TII
2010
13 years 3 months ago
2010
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
POPL
2000
ACM
14 years 10 days ago
2000
ACM
Various code certification systems allow the certification and static verification of important safety properties such as memory and control-flow safety. These systems are valuabl...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
ECRTS
2002
IEEE
14 years 1 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
VMV
2003
13 years 10 months ago
2003
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...