2002
DOI: 10.1002/spe.454
|View full text |Cite
|
Sign up to set email alerts
|

A safe variant of the unsafe integer arithmetic of Java™

Abstract: Computers are finite machines and, therefore, the arithmetic operations in a programming language are different from their mathematical counterparts. These restrictions seem not to have been, in general, fully appreciated in programming languages and in computer science textbooks. One example is the programming language Java, which makes it difficult to warn the user in cases in which arithmetic operations produce incorrect results. In this paper we look at integer arithmetic in Java and develop a safe variant… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2003
2003

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…However, there are legitimate concerns about integral types as well. It is argued in [19] that Java's integral types are unsafe, because overflow is not detected via exceptions, and are confusing because of the asymmetric way that conversions work: arguments are automatically promoted, but results are not automatically "demoted" 1 .…”
Section: Introductionmentioning
confidence: 99%
“…However, there are legitimate concerns about integral types as well. It is argued in [19] that Java's integral types are unsafe, because overflow is not detected via exceptions, and are confusing because of the asymmetric way that conversions work: arguments are automatically promoted, but results are not automatically "demoted" 1 .…”
Section: Introductionmentioning
confidence: 99%