Software reliability via run-time result-checking

Hal Wasserman; Manuel Blum

doi:10.1145/268999.269003

Software reliability via run-time result-checking

Hal Wasserman
, Manuel Blum

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

133 Citations (Scopus)

Abstract

We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed.
© 1997 ACM

Original language	English
Pages (from-to)	826-849
Journal	Journal of the ACM
Volume	44
Issue number	6
DOIs	https://doi.org/10.1145/268999.269003
Publication status	Published - Nov 1997
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

The work of H. Wasserman was supported by NDSEG Fellowship DAAH04-93-G-0267. The work of M. Blum was supported in part by the National Science Foundation (NSF) grant CCR 92-01092, and in part by a MICRO grant from Hughes Aircraft Corporation and the State of California.

Research Keywords

Algorithms
Built-in testing
Concurrent error detection
Debugging
Fault tolerance
Fourier Transform
Reliability
Result-checking
Self-correcting
Verification

Access Output

10.1145/268999.269003

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{c2fd1fc0d035471f9d985d62119d08f2,

title = "Software reliability via run-time result-checking",

abstract = "We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed. {\textcopyright} 1997 ACM",

keywords = "Algorithms, Built-in testing, Concurrent error detection, Debugging, Fault tolerance, Fourier Transform, Reliability, Result-checking, Self-correcting, Verification",

author = "Hal Wasserman and Manuel Blum",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "1997",

month = nov,

doi = "10.1145/268999.269003",

language = "English",

volume = "44",

pages = "826--849",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery",

number = "6",

}

TY - JOUR

T1 - Software reliability via run-time result-checking

AU - Wasserman, Hal

AU - Blum, Manuel

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 1997/11

Y1 - 1997/11

N2 - We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed. © 1997 ACM

AB - We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed. © 1997 ACM

KW - Algorithms

KW - Built-in testing

KW - Concurrent error detection

KW - Debugging

KW - Fault tolerance

KW - Fourier Transform

KW - Reliability

KW - Result-checking

KW - Self-correcting

KW - Verification

UR - https://www.scopus.com/pages/publications/0031274275

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0031274275&origin=recordpage

U2 - 10.1145/268999.269003

DO - 10.1145/268999.269003

M3 - RGC 21 - Publication in refereed journal

SN - 0004-5411

VL - 44

SP - 826

EP - 849

JO - Journal of the ACM

JF - Journal of the ACM

IS - 6

ER -

Software reliability via run-time result-checking

Abstract

Bibliographical note

Funding

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this