494 search results - page 30 / 99 » Heap Building Bounds |
148
Voted
SIGSOFT
2004
ACM
16 years 4 months ago
2004
ACM
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
263
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
160
Voted
ALGORITHMICA
2011
14 years 11 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
106
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
142
click to vote
MCSS
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we consider systems which are globally completly observable and output-to-state stable. The former property guarantees the existence of coordinates such that the dyna...