See this document in CiteSeerX!

Software Reliability via Run-Time Result-Checking (1994)  (Make Corrections)  (55 citations)
International Computer Science Institute 1947 Center St. Suite 600 Berkeley,...
Journal of the ACM



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
berkeley.edu/pub/tech...tr94053.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/techreports/1994 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We review the field of result-checking, discussing simple checkers and selfcorrectors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and reliable functionality. We consider how to modify traditional checking methodologies to make them more appropriate for use in realtime, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: i.e., that they should be allowed to generate,... (Update)

Cited by:   More
USENIX Association - Th Usenix Security (1992)   (Correct)
BIND: A Fine-grained Attestation Service for - Secure Distributed Systems   (Correct)
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch   (Correct)

Similar documents (at the sentence level):
37.7%:   Software Reliability via Run-Time Result-Checking - Wasserman, Blum (1994)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Self-Testing/Correcting with Applications to Numerical.. - Blum, Luby, Rubinfeld (1990)   (Correct)
0.5:   Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994)   (Correct)
0.3:   Ranyi, A., (1970), Probability Theory, North-Holland.. - Rosser Schoenfeld.. (1991)   (Correct)

Similar documents based on text:   More   All
0.2:   Hal Wasserman - School Of Computer   (Correct)
0.1:   Reflections on the Pentium Division Bug - Blum, Wasserman (1995)   (Correct)
0.0:   High-Performance Digit-Serial Complex-Number.. - Chang, Parhi (1998)   (Correct)

Related documents from co-citation:   More   All
30:   Designing Programs that Check their Work - Blum, Kannan - 1989
8:   The design and implementation of a certifying compiler - Necula, Lee - 1998
7:   On Checker-Based Program Verification (context) - Goerigk, Gaul et al. - 1998

BibTeX entry:   (Update)

M. Blum and H. Wasserman, "Software reliability via run-time result-checking," http://http.cs.berkeley.edu/- ~blum/. Submitted to Journal of the ACM. Preliminary version: "Program result-checking: a theory of testing meets a test of theory," Proc. 35th Symp. Foundations of Computer Science, pp. 382--392, 1994. http://citeseer.ist.psu.edu/article/blum94software.html   More

@article{ wasserman97software,
    author = "Hal Wasserman and Manuel Blum",
    title = "Software reliability via run-time result-checking",
    journal = "Journal of the ACM",
    volume = "44",
    number = "6",
    pages = "826--849",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/blum94software.html" }
Citations (may not include all citations):
957   The Probabilistic Method (context) - Alon, Spencer et al. - 1992  ACM   DBLP
242   Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991  ACM   DBLP
192   Designing programs that check their work - Blum, Kannan - 1989  ACM   DBLP
132   Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990  ACM   DBLP
78   Programming Pearls (context) - Bentley - 1986  ACM
64   The infeasibility of quantifying the reliability of life-cri.. - Butler, Finelli - 1993  ACM   DBLP
54   Checking the correctness of memories - Blum, Evans et al. - 1994  ACM   DBLP
43   Highly resilient correctors for polynomials - Gemmell, Sudan - 1992  ACM   DBLP
40   Designing programs to check their work (context) - Blum - 1988
33   Probabilistic checking of proofs; a new characterization of .. (context) - Arora, Safra - 1992  DBLP
28   Fast probabilistic algorithms (context) - Freivalds - 1979  DBLP
23   Checking approximate computations over the reals - Ar, Blum et al. - 1993  ACM   DBLP
20   On being incoherent without being very hard - Beigel, Feigenbaum - 1992  ACM   DBLP
10   A note on self-testing/correcting methods for trigonometric .. (context) - Cleve, Luby - 1990
10   personal communication (context) - Blum
7   Self-testing/correcting for polynomials and for approximate .. - Gemmell, Lipton et al. - 1991  ACM   DBLP
6   Testing multivariate linear functions: overcoming the genera.. - Ergun - 1994  DBLP
3   the complexity of coherent sets (context) - Beigel, Feigenbaum - 1990
2   Are there interactive protocols for co-NP languages (context) - Fortnow, Sipser - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.icsi.berkeley.edu/techreports/1994.html):   More
Some MPEG Decoding Functions on Spert An Example for Assembly.. - Formella (1994)   (Correct)
Traffic Characterization and Switch Utilization using a.. - Knightly, Zhang (1994)   (Correct)
Experiments with the Tenet Real-Time Protocol Suite .. - Banerjea.. (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC