Sciweavers

207 search results - page 11 / 42
» Smoothed analysis of integer programming
Sort
View
POPL
2003
ACM
15 years 10 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost
ESORICS
2004
Springer
15 years 3 months ago
ARCHERR: Runtime Environment Driven Program Safety
Parameters of a program’s runtime environment such as the machine architecture and operating system largely determine whether a vulnerability can be exploited. For example, the m...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
ISPAN
2002
IEEE
15 years 2 months ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 3 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
SAS
1991
Springer
15 years 1 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford