A (De)constructive approach to program checking

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 143-152

  Goldwasser, Shafi ^a   Gutfreund, Dan ^b   Healy, Alexander ^c   Kaufman, Tali ^d   Rothblum, Guy N ^e  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d Institute for Advanced Study

^e MIT MEDIA LAB   (United States)

Author keywords

Theory

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; MATRIX ALGEBRA; VERIFICATION;

BOUNDED DEGREE GRAPHS; COMBINATORIAL PROPERTIES; CONSTRUCTIVE APPROACH; MATRIX MULTIPLICATION; PERFECT MATCHINGS; PROGRAM CORRECTNESS; PROGRAM VERIFICATION; THEORY;

SOFTWARE TESTING;

EID: 57049109963     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374399     Document Type: Conference Paper

References (30)

1. 0. SIAM Journal on Computing, 2004. To appear. Preliminary version in FOCS 2004.
2. V. Arvind, K. Subrahmanyam, and N. Vinodchandran. The query complexity of program checking by constant-depth circuits. Chicago Journal of Theoretical Computer Science, 2, 2002.
3. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. In FOCS, pages 16-25, 1990.
4. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulation unless Exptime has publishable proofs. Computational Complexity, 3:307-318, 1993.
5. B. Barak. A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms. In RANDOM, pages 194-208, 2002.
6. 1. Journal of Computer and System Sciences, 3S(1):150-164, 1989.
7. R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser. Languages that are easier than their proofs. In FOCS, pages 19-28, 1991.
8. M. Ben-Or, D. Coppersmith, M. Luby, and R. Rubinfeld. Non-abelian homomorphism testing, and distributions close to their self-convolutions. In Proceedings of APPROX-RANDOM, pages 273-285, 2004.
9. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42(1):269-291, 1995.
10. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
11. D. Coppersmith and S. Winograd. Matrix muliplication via arithmetic progressions. In STOC, pages 1-6, 1987.
12. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In STOC, pages 554-563, 1994.
13. L. Fortnow and R. Santhanam. Hierarchy theorems for probabilistic polynomial time. In FOCS, pages 316-324, 2004.
14. L. Fortnow, R. Santhanam, and L. Trevisan. Hierarchies for semantic classes. In STOC, pages 348-355, 2005.
15. R. Freivalds. Fast probablistic algorithms. Springer Verlag Lecture Notes in CS, Mathematical Foundations of CS, 74:57-69, 1979.
16. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(l):13-27, April 1984.
17. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G. N. Rothblum. A (de)constructive approach to program checking. EGGG Technical Report, TR07-047, 2007.
18. S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G. N. Rothblum. Verifying and decoding in constant depth. In STOC, pages 440-449, 2007.
19. D. Gutfreund, R. Shaltiel, and A. Ta-Shma. Uniform hardness vs. randoness tradeoffs for Arthur-Merlin games. Computational Complexity, 12:85-130, 2003.
20. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In CCC, pages 1-11, 2001.
21. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In In proceedins of 29th ICALP, pages 244-256, 2002.
22. J. Kilian. Founding cryptography on oblivious transfer. In STOC, pages 20-31, 1988.
23. R. Lipton. New directions in testing. Proceedings of DIMA CS workshop on distributed computing and cryptography, 2:191-202, 1991.
24. D. Randall. Effcient random generation of nonsingular matrices. Technical Report 91, U.C. Berekely Technical Report, Computer Science Department.
25. R. Rubinfeld. Designing checkers for programs that run in parallel. Algorithmica, 15(4):287-301, 1996.
26. R. Santhanam. Circuit lower bounds for Merlin-Arthur classes. In STOC, pages 275-283, 2007.
27. R. Shaltiel and C. Umans. Low-end uniform hardness vs. randomness tradeoffs for am. In STOC, pages 430-439, 2007.
28. A. Shamir. IP = PSPACE. In FOCS, pages 11-15, 1990.
29. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In CCC, pages 129-138, 2002.
30. H. Wasserman and M. Blum. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826-849, 1997.