1452 search results - page 27 / 291 » Algorithmic Analysis of Array-Accessing Programs |
CADE
2001
Springer
16 years 22 days ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
117
click to vote
MP
2007
14 years 12 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
SCAM
2008
IEEE
15 years 6 months ago
2008
IEEE
Programming embedded system software typically involves more than one programming language. Normally, a high-level language such as C/C++ is used for application oriented tasks an...
103
Voted
WCET
2010
14 years 10 months ago
2010
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
99
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...