A taxonomy of problems with fast parallel algorithms
Information and Control
Software testing and evaluation
Software testing and evaluation
Combinatorial enumeration of groups, graphs, and chemical compounds
Combinatorial enumeration of groups, graphs, and chemical compounds
On helping by robust oracle machines
Theoretical Computer Science
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The evaluation of program-based software test data adequacy criteria
Communications of the ACM
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Program checkers for probability generation
Proceedings of the 18th international colloquium on Automata, languages and programming
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Checking the correctness of memories
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Random-self-reducibility of complete sets
SIAM Journal on Computing
On being incoherent without being very hard
Computational Complexity
Efficient checkers for number-theoretic computations
Information and Computation
Social processes and proofs of theorems and programs
Communications of the ACM
The Correctness Problem in Computer Science
The Correctness Problem in Computer Science
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Reducing randomness via irrational numbers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Specification-consistent coordination model for computations
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Theory of software reliability based on components
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
AλgoVista: a tool to enhance algorithm design and understanding
Proceedings of the 7th annual conference on Innovation and technology in computer science education
Semi-proving: an integrated method based on global symbolic evaluation and metamorphic testing
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Continuity in software systems
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Applying data redundancy to differential equation solvers
Annals of Software Engineering
Watermarking, tamper-proffing, and obfuscation: tools for software protection
IEEE Transactions on Software Engineering
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Fault-Detection by Result-Checking for the Eigenproblem
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Construction of Verified Compiler Front-Ends with Program-Checking
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Rigorous Compiler Implementation Correctness: How to Prove the Real Thing Correct
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Nonadaptive NC Checker for Permutation Group Intersection
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Proceedings of the 2003 ACM symposium on Applied computing
AlgoVista: an algorithmic search tool in an educational setting
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Fast approximate probabilistically checkable proofs
Information and Computation
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Problem identification using program checking
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Soft Tamper-Proofing via Program Integrity Verification in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
High Performance Computing Systems for Autonomous Spaceborne Missions
International Journal of High Performance Computing Applications
An effective testing method for end-user programmers
WEUSE I Proceedings of the first workshop on End-user software engineering
The Complexity of Online Memory Checking
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A historical perspective on runtime assertion checking in software development
ACM SIGSOFT Software Engineering Notes
Information Processing Letters
System Call Monitoring Using Authenticated System Calls
IEEE Transactions on Dependable and Secure Computing
Journal of Systems and Software - Special issue: Quality software
An empirical comparison between direct and indirect test result checking approaches
Proceedings of the 3rd international workshop on Software quality assurance
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The complexity of online memory checking
Journal of the ACM (JACM)
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Finding paths of length k in O∗(2k) time
Information Processing Letters
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Automatic system testing of programs without test oracles
Proceedings of the eighteenth international symposium on Software testing and analysis
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
International Journal of High Performance Computing Applications
Specifications using XQuery Expressions on Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
A Program Result Checker for the Lexical Analysis of the GNU C Compiler
Electronic Notes in Theoretical Computer Science (ENTCS)
Deductive Runtime Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the complexity of the hidden subgroup problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Formal verification with Isabelle/HOL in practice: finding a bug in the GCC scheduler
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Live forensics framework for wireless sensor nodes using sandboxing
Proceedings of the 6th ACM workshop on QoS and security for wireless and mobile networks
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Self-testing of quantum circuits
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A functional framework for result checking
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Computer Science Review
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Checking and spot-checking the correctness of priority queues
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Patterns for building dependable systems with trusted bases
Proceedings of the 17th Conference on Pattern Languages of Programs
| Hi-index | 0.01 |
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.