Sciweavers

1452 search results - page 27 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
CADE
2001
Springer
14 years 10 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
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...
Harald Ganzinger, David A. McAllester
MP
2007
95views more  MP 2007»
13 years 9 months ago
Smoothed analysis of integer programming
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...
Heiko Röglin, Berthold Vöcking
SCAM
2008
IEEE
14 years 4 months ago
Some Assembly Required - Program Analysis of Embedded System Code
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...
Ansgar Fehnker, Ralf Huuck, Felix Rauch, Sean Seef...
WCET
2010
13 years 7 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
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...
Benedikt Huber, Peter P. Puschner
CAV
2007
Springer
112views Hardware» more  CAV 2007»
14 years 4 months ago
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
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...
Ahmed Bouajjani, Séverine Fratani, Shaz Qad...