00000cab a22000003a 4500 UP-99796217608727538 Buklod 20231007234724.0 m |o d | ta 090226s xx d | ||r ||||| || (iLib)UPD-00077096452 DENGII eng Wasserman, Hal Software reliability via run-time result-checking. pp. 826-849 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. Software. Software engineering. Theory of computation. Analysis of algorithms and problem complexity. Numerical algorithms and problems. Computation of transforms (e.g., fast Fourier transform). Logics and meanings of programs. Algorithms. Reliability. Verification. Journal of the ACM 44, 6 (1997). FO UPD DENG-II Article