Open AccessRevisiting Overflow in Integer Multiplication
Author(s) -
Eyas El-Qawasmeh,
Ahmed Dalalah
Publication year - 2005
Publication title -
journal of computer sciences/journal of computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.161
H-Index - 28
eISSN - 1552-6607
pISSN - 1549-3636
DOI - 10.3844/jcssp.2005.304.309
Subject(s) - computer science , multiplication (music) , integer (computer science) , arithmetic , theoretical computer science , parallel computing , programming language , mathematics , combinatorics
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