DocumentCode
746633
Title
Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing
Author
Roe, Robert P. ; Rowland, John H.
Author_Institution
Department of Mathematics, Fort Lewis College
Issue
6
fYear
1987
fDate
6/1/1987 12:00:00 AM
Firstpage
677
Lastpage
682
Abstract
Several inequalities are derived for use in certifying function subroutines by means of black box testing. It is assumed that a function is approximated by means of a polynomial of limited degree on a closed interval. These inequalities give upper bounds on the error of the approximation over the entire interval based on the error measured over a finite sample and known properties of the function.
Keywords
Certification; sampling; testing; Algorithms; Certification; Computer languages; Differential equations; Mathematics; NIST; Polynomials; Sampling methods; Testing; Upper bound; Certification; sampling; testing;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1987.233205
Filename
1702273
Link To Document