See this document in CiteSeerX!

Software Reliability via Run-Time Result-Checking (1994)  (Make Corrections)  (55 citations)
Hal Wasserman, Manuel Blum
Journal of the ACM



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~blum/fourier.ps
berkeley.edu/~halw/fourier.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~blum...publications (more)
Homepages:  H.Wasserman  

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

Abstract: ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org. 2 \Delta H. Wasserman and M. Blum 1. RESULT-CHECKING AND ITS APPLICATIONS 1.1 Assuring Software Reliability Methodologies for assuring... (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):
23.6%:   Software Reliability via Run-Time Result-Checking - Manuel Blum Hal (1994)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Self-Testing/Correcting with Applications to Numerical.. - Blum, Luby, Rubinfeld (1990)   (Correct)
0.5:   Reflections on the Pentium Division Bug - Blum, Wasserman (1995)   (Correct)
0.3:   Self-Testing Without the Generator Bottleneck - Ergün, Kumar, Sivakumar (1995)   (Correct)

Similar documents based on text:   More   All
0.2:   Hal Wasserman - School Of Computer   (Correct)
0.0:   High-Performance Digit-Serial Complex-Number.. - Chang, Parhi (1998)   (Correct)
0.0:   A Universal Characterization of the Closed Euclidean.. - Escardó, Simpson   (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/wasserman94software.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/wasserman94software.html" }
Citations (may not include all citations):
149   Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980
132   Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990
78   Programming Pearls (context) - Bentley - 1986
64   The infeasibility of quantifying the reliability of life-cri.. - Butler, Finelli - 1993
54   Checking the correctness of memories - Blum, Evans et al. - 1994
43   Highly resilient correctors for polynomials - Gemmell, Sudan - 1992
33   Probabilistic checking of proofs; a new characterization 22 .. (context) - Arora, Safra - 1992
28   Fast probabilistic algorithms (context) - Freivalds - 1979
14   Reflections on the pentium division bug - Blum, Wasserman - 1996
10   Program Result-Checking with Applications (context) - Kannan - 1990
10   Personal communication (context) - Blum - 1994
7   Batch checking with applications to linear functions (context) - Rubinfeld - 1992
6   Efficient checking of computations (context) - Lipton - 1990
4   Testing multivariate linear functions: overcoming the genera.. (context) - un - 1995
3   Co-SAT has multi-prover interactive proofs (context) - Nisan - 1989
3   On self-testing without the generator bottleneck - Ravikumar, Sivakumar - 1995
3   and Erd os (context) - Alon, Spencer - 1992
3   Self-testing polynomial functions efficiently and over ratio.. - Rubinfeld, Sudan - 1992
2   Program checkers: practical applications to real-time softwa.. (context) - Boettcher, Mellema - 1995



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


Documents on the same site (http://http.cs.berkeley.edu/~blum/publications.html):
Reflections on the Pentium Division Bug - Blum, Wasserman (1995)   (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