Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with program checking:
TR97-010 | 2nd April 1997
Marcos Kiwi

Testing and Weight Distributions of Dual Codes

We study the testing problem, that is, the problem of determining (maybe
probabilistically) if a function to which we have oracle access
satisfies a given property.

We propose a framework in which to formulate and carry out the analyzes
of several known tests. This framework establishes a connection between
more >>>

TR98-078 | 1st December 1998
Vikraman Arvind, K.V. Subrahmanyam, Vinodchandran Variyam

The Query Complexity of Program Checking by Constant-Depth Circuits

In this paper we study program checking (in the
sense of Blum and Kannan) using constant-depth circuits as
checkers. Our focus is on the number of queries made by the
checker to the program being checked and we term this as the
query complexity of the checker for the given ... more >>>

TR99-025 | 2nd July 1999
Yonatan Aumann, Johan Hastad, Michael O. Rabin, Madhu Sudan

Linear Consistency Testing

We extend the notion of linearity testing to the task of checking
linear-consistency of multiple functions. Informally, functions
are ``linear'' if their graphs form straight lines on the plane.
Two such functions are ``consistent'' if the lines have the same
slope. We propose a variant of a test of ... more >>>

TR07-047 | 15th May 2007
Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy Rothblum

A (De)constructive Approach to Program Checking

Program checking, program self-correcting and program self-testing
were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in
the mid eighties as a new way to gain confidence in software, by
considering program correctness on an input by input basis rather than
full program verification. Work in ... more >>>

ISSN 1433-8092 | Imprint