In a bounded analysis, arithmetic operators become partial, and a different semantics becomes necessary. One approach, mimicking programming languages, is for overflow to result in wrap-around. Although easy to implement, wrap-around produces unexpected counterexamples that do not correspond to cases that would arise in the unbounded setting. This paper describes a new approach, implemented in ...

This paper deals with the problem of undesired memory effects in nonlinear digital filters owing to the influence of past excitations on future outputs. The nonlinearities under consideration cover the usual types of overflow arithmetic employed in practice. Based on the Hankel norm performance, a new criterion is proposed to ensure the reduction of undesired memory effects in digital filters w...

Dynamically tagged directories are memory-efficient mechanisms for maintaining cache coherence in sharedmemory multiprocessors. These directories use specialpurpose caches of pointers that are subject to two types of overflow: 1) pointer overflow, which limits the maximum sharing of a memory block, and 2) set overflow, which forces the premature invalidation of cached blocks. We propose a super...

In this paper, we are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad-hoc wireless networks where each link interferes with a given set of other links, and we focus on a distributed scheduling algorithm called Q-SCH...

ÐIn a cellular phone system, mobility databases called visitor location registers (VLRs) are used to temporarily hold the subscription information of the roaming users who visit the service area of the VLR. When the users leave the VLR area, the corresponding records in the VLR are deleted. Due to user mobility, the capacity of the VLR may not be large enough to hold information for all visitor...

Buffer overflow attacks are among the oldest and most common attacks used to gain privileged access to a computer system. In fact, statistics from Carnegie Mellon’s Computer Emergency Response Team reveal that buffer overflow vulnerabilities accounted for about 50% of all reported vulnerabilities in 2000 [2]. It is surprising that after almost 20 years of buffer overflow exploits, they are stil...

Introduction Conclusions References

ÐHigh-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred...