Article

Free access

Spot-checkers

Authors:

Mahesh ViswanathanAuthors Info & Claims

STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing

Pages 259 - 268

https://doi.org/10.1145/276698.276757

Published: 23 May 1998 Publication History

PDF eReader

References

[1]

J. Aczel. Lectures on Functional Equations and their Applications. Academic Press, 1966.

Google Scholar

[2]

L. M. Adleman, M-D. Huang, and K. Kompella. Efficient checkers for number-theoretic computations. Information and Computation, 121(1):93-102, 1995

Digital Library

Google Scholar

[3]

S. At, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. Proc. 25th Symposium on Theory of Computing, pp. 786-795, 1993.

Digital Library

Google Scholar

[4]

S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd Foundations of Computer Science, pp. 14--23, 1992.

Digital Library

Google Scholar

[5]

S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Proc. 33rd Foundations of Computer Science, pp. 2-13, 1992.

Digital Library

Google Scholar

[6]

M. Bellare, J. Garay, T. Rabin. Batch verification with applications to cryptography and checking. Proc. Latin American Theoretical Informatics 98, Springer LNCS 1830:267-288, 1998. By the same authors Fast Batch Verification for modular exponentiation and digital signatures. Proceedings of Eurocrypt 98, Springer-Verlag LNCS, Editor K. Nyberg, 1998, to appear.

Digital Library

Google Scholar

[7]

M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Proc. 32nd Foundations of Computer Science, pp. 90- 99, 1991.

Digital Library

Google Scholar

[8]

M. Blum and S. Kannan. Designing programs that check their work. Proc. 21st Symposium on Theory of Computing, pp. 86--97, 1989.

Digital Library

Google Scholar

[9]

M. Blum, M. Luby, and R. Rubinfeld. Selftesting/correcting with applications to numerical problems. J. of Computing and System Sciences, 47(3):549- 595, 1993.

Digital Library

Google Scholar

[10]

M. Blum and H. Wasserman. Program resultchecking: A theory of testing meets a test of theory. Proc. 35th Foundations of Computer Science, pp. 382- 392, 1994.

Google Scholar

[11]

M. Blum and H. Wasserman. Reflections on the Pentium division bug. Proc. 8th Intl. Software Quality It~ek, 1994.

Google Scholar

[12]

E. Castillo and M.R. Ruiz-Cobo. Functional Equations and Modeling in Science and Engineering. Marcel Dekker Inc., 1992.

Google Scholar

[13]

E Ergiin, S. Ravi Kumar, and R. Rubinfeld. Approximate checking of polynomials and functional equations. Proc. 37th Foundations of Computer Science, pp. 592--601, 1996.

Digital Library

Google Scholar

[14]

F. Ergiin, S. Ravi Kumar, and D. Sivakumar. Selftesting without the generator bottleneck, sicomp, to appear.

Google Scholar

[15]

P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. Proc. 23rdSymposium on Theory of Computing, pp. 32--42, 199 I.

Digital Library

Google Scholar

[16]

O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximarion. Proc. 37th Foundations of Computer Science, pp. 339-348, 1996.

Digital Library

Google Scholar

[17]

O. Goldreich and D. Ron. Property testing in bounded degree graphs. Proc. 29th Symposium on Theor3' of Computing, pp. 406--415, 1997.

Digital Library

Google Scholar

[18]

S. Kannan. Program Result Checking with Applications. PhD thesis, U. of California at Berkeley, 1990.

Google Scholar

[19]

S. Ravi Kumar and R. Rubinfeld. Testing Abelian Group Operations. Manuscript.

Google Scholar

[20]

S. Ravi Kumar and D. Sivakumar. Efficient selftesting/self-correction of linear recurrences. Proc. 37th Foundations of Computer Science, pp. 602-611, 1996.

Digital Library

Google Scholar

[21]

R. Lipton. New directions in testing. Proc. i)I- MACS $ibr 'kshop on Distr. Comp. and Cryptography, pp. 191-202, 1991.

Google Scholar

[22]

R. Rubinfeld. Robust functional equations with applications to self-testing/correcting. Proc. 35th Fottndations of Computer Science, pp. 288-299, 1994.

Google Scholar

[23]

R. Rubinfeld and M. Sudan. Testing polynomial functions efficiently and over rational domains, Proc. 3rd Symposium on Discrete Algorithms, pp. 23-43, 1992.

Digital Library

Google Scholar

[24]

R. Rubinfeld and M. Sudan. Robust characterizations of polynomials and their applications to program testing. SIAM J. on Computing, 25(2):252-271, 1996,

Digital Library

Google Scholar

[25]

S. Rajagopalan and L. Schulman. Verifying identifies. Proc. 37th Foundations of Computer Science, pp. 612--616, 1996.

Digital Library

Google Scholar

[26]

F. Vainstein. Algebraic Methods in Hardware/So, are Testing. PhD thesis, Boston University, 1993.

Digital Library

Google Scholar

Cited By

View all

Ron DRosin A(2022)Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided ErrorACM Transactions on Computation Theory10.1145/351275014:1(1-31)Online publication date: 23-Mar-2022
https://dl.acm.org/doi/10.1145/3512750
Newman IRabinovich YRajendraprasad DSohler C(2019)Testing for forbidden order patterns in an arrayRandom Structures & Algorithms10.1002/rsa.2084055:2(402-426)Online publication date: 17-Jan-2019
https://doi.org/10.1002/rsa.20840
SWORDS CSABRY ATOBIN-HOCHSTADT S(2018)An extended account of contract monitoring strategies as patterns of communicationJournal of Functional Programming10.1017/S095679681800004728Online publication date: 7-Mar-2018
https://doi.org/10.1017/S0956796818000047
Show More Cited By

Index Terms

Spot-checkers
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

Recommendations

Designing programs that check their work

A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output of the program on that instance is correct. This paper ...
Implicit representation of graphs
STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing

How to represent a graph in memory is a fundamental data structuring question. In the usual representations of an n-node graph, the names of the nodes (i.e. integers from 1 to n) betray nothing about the graph itself. Indeed, the names (or labels) on ...
Cryptographic limitations on learning Boolean formulae and finite automata

In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation ...

Comments

Information & Contributors

Information

Published In

STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing

May 1998

684 pages

ISBN:0897919629

DOI:10.1145/276698

Chairman:
Jeffrey Vitter

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC98

Sponsor:

SIGACT

STOC98: The 30th Annual ACM Symposium on Theory of Computing

May 24 - 26, 1998

Texas, Dallas, USA

Acceptance Rates

STOC '98 Paper Acceptance Rate 75 of 169 submissions, 44%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
586
Total Downloads

Downloads (Last 12 months)129
Downloads (Last 6 weeks)19

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ron DRosin A(2022)Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided ErrorACM Transactions on Computation Theory10.1145/351275014:1(1-31)Online publication date: 23-Mar-2022
https://dl.acm.org/doi/10.1145/3512750
Newman IRabinovich YRajendraprasad DSohler C(2019)Testing for forbidden order patterns in an arrayRandom Structures & Algorithms10.1002/rsa.2084055:2(402-426)Online publication date: 17-Jan-2019
https://doi.org/10.1002/rsa.20840
SWORDS CSABRY ATOBIN-HOCHSTADT S(2018)An extended account of contract monitoring strategies as patterns of communicationJournal of Functional Programming10.1017/S095679681800004728Online publication date: 7-Mar-2018
https://doi.org/10.1017/S0956796818000047
Swords CSabry ATobin-Hochstadt S(2015)Expressing contract monitors as patterns of communicationACM SIGPLAN Notices10.1145/2858949.278474250:9(387-399)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784742
Swords CSabry ATobin-Hochstadt SFisher KReppy J(2015)Expressing contract monitors as patterns of communicationProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784742(387-399)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784742
Yang CRen JMa J(2015)Provable ownership of files in deduplication cloud storageSecurity and Communication Networks10.1002/sec.7848:14(2457-2468)Online publication date: 25-Sep-2015
https://dl.acm.org/doi/10.1002/sec.784
Rahman S(2014)Towards integrity protection of software for e-health data2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)10.1109/ICMEW.2014.6890681(1-5)Online publication date: Jul-2014
https://doi.org/10.1109/ICMEW.2014.6890681
Chao Yang Jian Ren Jianfeng Ma (2013)Provable ownership of file in de-duplication cloud storage2013 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2013.6831153(695-700)Online publication date: Dec-2013
https://doi.org/10.1109/GLOCOM.2013.6831153
Goldreich O(2011)On the average-case complexity of property testingStudies in complexity and cryptography10.5555/2028116.2028132(124-135)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2028116.2028132
Chazelle BSeshadhri C(2011)Online geometric reconstructionJournal of the ACM10.1145/1989727.198972858:4(1-32)Online publication date: 20-Jul-2011
https://dl.acm.org/doi/10.1145/1989727.1989728
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Designing programs that check their work

Implicit representation of graphs

Cryptographic limitations on learning Boolean formulae and finite automata

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Designing programs that check their work

Implicit representation of graphs

Cryptographic limitations on learning Boolean formulae and finite automata

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations