TY  - JOUR
AU  - El-Qawasmeh, Eyas 
AU  - Dalalah, Ahmed 
PY  - 2005
TI  - Revisiting Overflow in Integer Multiplication
JF  - Journal of Computer Science
VL  - 1
IS  - 3
DO  - 10.3844/jcssp.2005.304.309
UR  - https://thescipub.com/abstract/jcssp.2005.304.309
AB  - Integer multiplication is a very common operation that is executed in many applications.
However, some of these applications suffer from the overflow problem caused by the multiply
operation of two operands. The overflow occurs whenever the multiplication of any two-integer
numbers exceeds the maximum limit available for the result. Many programming languages ignored
this problem; therefore, the programmer has to handle it, mostly in “predict and avoid” approach. Present study addresses the detection and control of integer overflow in programming languages. Two examples from C and JAVA programming languages are considered. The paper suggests “detect and do” algorithms to handle the overflow. In addition, this paper suggests adding a built-in function to test whether an overflow will be generated by multiplication operation in advance.