Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing

Robert Paul Roe; J. H. Rowland

doi:10.1109/TSE.1987.233205

Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing

Robert Paul Roe
, J. H. Rowland

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	IEEE Transactions on Software Engineering
DOIs	https://doi.org/10.1109/TSE.1987.233205
State	Published - Jan 1 1987

Keywords

Certification
Sampling
Testing

Disciplines

Mathematics
Statistics and Probability

Access to Document

10.1109/TSE.1987.233205License: Unspecified

https://doi.org/10.1109/TSE.1987.233205

Cite this

@article{98515518c71147ce8a886cb96e3f6705,

title = "Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing",

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",

author = "Roe, \{Robert Paul\} and Rowland, \{J. H.\}",

year = "1987",

month = jan,

day = "1",

doi = "10.1109/TSE.1987.233205",

language = "American English",

journal = "IEEE Transactions on Software Engineering",

}

TY - JOUR

T1 - Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing

AU - Roe, Robert Paul

AU - Rowland, J. H.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - 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.

AB - 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.

KW - Certification

KW - Sampling

KW - Testing

UR - https://scholarsmine.mst.edu/math_stat_facwork/686

UR - https://doi.org/10.1109/TSE.1987.233205

U2 - 10.1109/TSE.1987.233205

DO - 10.1109/TSE.1987.233205

M3 - Article

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

ER -

Some Theory Concerning Certification of Mathematical Subroutines by Black Box Testing

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Fingerprint

Cite this