Skip to main content
SpringerLink
Log in

Program checking

  • Invited Papers
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 560))

This work was supported in part by NSF grant. CCR 88-13632.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • L. Babai, L. Fortnow, L.A. Levin, M. Szegedy, “Checking Computations in Polylogarithmic Time,” Univ. of Chicago Tech. Rept. 91–08 (March 1991) and in Proc. 23rd ACM STOC 91

    Google Scholar 

  • L. Babai, L. Fortnow, and C. Lund, “Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols,” Univ. of Chicago Tech. Rept. 91–10, 39 pp (April 1991). To appear in “Computational Complexity,” Vol 1, No 1 (1991).

    Google Scholar 

  • M. Blum, M. Luby, and R. Rubinfeld, “Self-Testing/Correcting with Applications to Numerical Problems,” STOC 90 (May 1990), 73–83.

    Google Scholar 

  • M. Blum and S. Kannan, “Designing Programs that Check their Work”, 21st Annual Symposium on Theory of Computing (May 1989), pp. 86–97.

    Google Scholar 

  • J.L. Carter and M.N. Wegman, “New Hash Functions and Their Use in Authentication and Set Equality,” J. of Comp. and Syst. Science, Vol 22, No 3, pp 265–279 (1981).

    Article  Google Scholar 

  • R.J. Lipton, “New Directions in Testing,” Computer Science Dept Tech. Report, Princeton University (1989).

    Google Scholar 

  • R. Kannan (Personal Communication)

    Google Scholar 

  • J. Schwartz, “Fast Probabilistic Algorithms for Verification of Polynomial Identities,” J. ACM, Vol 27, No 4, pp 701–717 (October 1980).

    Article  Google Scholar 

  • A. Shamir, “IP = PSPACE,” Proc. 31st IEEE FOCS 90, pp. 11–15(October 1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CS Division, EECS Department, University of California at Berkeley, 94720, Berkeley, CA

    Manuel Blum

Authors
  1. Manuel Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blum, M. (1991). Program checking. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-54967-6_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54967-3

  • Online ISBN: 978-3-540-46612-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation