Affiliation:
1. University of California at Berkeley, Berkeley, California
Abstract
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 defines the concept of a program checker. It designs program checkers for a few specific and carefully chosen problems in the class FP of functions computable in polynomial time. Problems in FP for which checkers are presented in this paper include Sorting, Matrix Rank and GCD. It also applies methods of modern cryptography, especially the idea of a probabilistic interactive proof, to the design of program checkers for group theoretic computations.
Two structural theorems are proven here. One is a characterization of problems that can be checked. The other theorem establishes equivalence classes of problems such that whenever one problem in a class is checkable, all problems in the class are checkable.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference37 articles.
1. ~ADLEMAN L. HUANG M. AND KOMPELLA K Efficient checkers for number-theoretic problems. ~Inf. Comput. to appear. 10.1006/inco.1995.1125 ~ADLEMAN L. HUANG M. AND KOMPELLA K Efficient checkers for number-theoretic problems. ~Inf. Comput. to appear. 10.1006/inco.1995.1125
2. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
3. Mathematical proofs of computer system correctness;~BARW~SE J.;Notices AMS,1989
4. Lecture Notes in Computer ~Science;~BEAVER D.
5. On being incoherent without being very hard
Cited by
205 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Relaxed Local Correctability from Local Testing;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Incorporating a Database of Graphs into a Proof Assistant;Lecture Notes in Computer Science;2024
4. Testing membership for timed automata;Acta Informatica;2023-07-17
5. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02