83 search results - page 7 / 17 » Bounding Loop Iterations for Timing Analysis |
111
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
159
Voted
RTAS
2008
IEEE
15 years 9 months ago
2008
IEEE
Embedded systems are often subject to constraints that require determinism to ensure that task deadlines are met. Such systems are referred to as real-time systems. Schedulability...
135
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
133
click to vote
TGC
2010
Springer
15 years 1 months ago
2010
Springer
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
138
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
— This paper presents a multiple-voltage high-level synthesis methodology for low power DSP applications using algorithmic transformation techniques. Our approach is motivated by...