Range Checking (was: And speaking of ...)

grover@brahmand.Eng.Sun.COM (Vinod Grover)
Thu, 19 Nov 1992 07:26:00 GMT

          From comp.compilers
Related articles
And speaking of fast compilers... pardo@cs.washington.edu (1992-11-12)
Re: And speaking of fast compilers... cheryl@gallant.apple.com (1992-11-17)
Range Checking (was: And speaking of ...) grover@brahmand.Eng.Sun.COM (1992-11-19)
| List of all articles for this month |
Newsgroups: comp.compilers
From: grover@brahmand.Eng.Sun.COM (Vinod Grover)
Organization: Sun Microsystems, Mt. View, Ca.
Date: Thu, 19 Nov 1992 07:26:00 GMT
Keywords: performance, optimize, design
References: 92-11-057 92-11-094

cheryl@gallant.apple.com (Cheryl Lins) writes:
>Range and bounds checking are variations on the constant propagation
>problem.


With proper design, range checking could also be viewed as common
subexpression elimination, code motion, and strength reduction. (In fact
partial redundancy elimination; PL.8 compiler used strength reduction to
eliminate some of the range checks). The intermediate representation could
be augmented with "check_range", "check_nil", etc. expressions for
traditional optimizations to be used.


More powerful techniques are based on abstract interpretation (Cousot &
Cousot [?], and Karr [Acta Informatica 197x); but may not be practical for
use in production quality compilers.


Vinod Grover
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.