decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
Sort of | 152 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
Some of our files is missing
Authored by: rcsteiner on Thursday, April 19 2012 @ 01:41 PM EDT
I suspect that bounds checking is as old as programming itself.

The oldest code I've personally worked with are utility libraries written in
UNIVAC 1108 assembly in 1966 as part of UNIMATIC at United Airlines, and many of
those did sanity checking of input values to ensure the programmer didn't want
to accidentally reference something off in hyperspace. IGDM (Guard Mode) errors
are unwelcome guests. :-)

---
-Rich Steiner >>>---> Mableton, GA USA
The Theorem Theorem: If If, Then Then.

[ Reply to This | Parent | # ]

Sort of
Authored by: Ian Al on Thursday, April 19 2012 @ 01:55 PM EDT
I think that it checks that the lower bound of the array to be sorted is not
less than zero and that the upper bound is not higher than the top of the
array.

It does seem to be the sort of sanity check that programmers have been exhorted
to put in their programs since Bad Programming (Pat. Pending) was first
invented.

---
Regards
Ian Al
Software Patents: It's the disclosed functions in the patent, stupid!

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )