Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Combinatorial enumeration of groups, graphs, and chemical compounds
Combinatorial enumeration of groups, graphs, and chemical compounds
The evaluation of program-based software test data adequacy criteria
Communications of the ACM
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Coherent functions and program checkers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A note on checking matrix products (extended abstract)
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Checking approximate computations over the reals
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
ACM SIGACT News
A taxonomy of proof systems (part 2)
ACM SIGACT News
Foundations of software testing: dependability theory
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Designing programs that check their work
Journal of the ACM (JACM)
Predicting dependability by testing
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reflections on the Pentium Division Bug
IEEE Transactions on Computers
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Formal specification techniques (extended abstract)
ICSE '94 Proceedings of the 16th international conference on Software engineering
Software reliability via run-time result-checking
Journal of the ACM (JACM)
A Formally Verified Sorting Certifier
IEEE Transactions on Computers
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Sim: a utility for detecting similarity in computer programs
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Approximate testing with relative error
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Post-mortem black-box correctness tests for basic parallel data structures
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Reliable benchmarks using numerical instability
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On zero-knowledge proofs (extended abstract): “from membership to decision”
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Testing and spot-checking of data streams (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Certification of Computational Results
IEEE Transactions on Computers
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Self-Testing/Correcting Protocols (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Space Bounded Provers
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Secure Distributed Computing in a Commercial Environment
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
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]
Oblivious Hashing: A Stealthy Software Integrity Verification Primitive
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Result checking in global computing systems
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Approximate testing with error relative to input size
Journal of Computer and System Sciences
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Emerging challenges in designing secure mobile appliances
Ambient intelligence
Securing Mobile Appliances: New Challenges for the System Designer
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Proceedings of the 2nd conference on Computing frontiers
Secure distributed human computation
Proceedings of the 6th ACM conference on Electronic commerce
An effective testing method for end-user programmers
WEUSE I Proceedings of the first workshop on End-user software engineering
Verification of an Off-Line Checker for Priority Queues
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Speeding up Exponentiation using an Untrusted Computational Resource
Designs, Codes and Cryptography
Specification-correct and scalable coordination of Grid applications
Future Generation Computer Systems
Extending tamper-proof hardware security to untrusted execution environments
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
Establishing the genuinity of remote computer systems
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Detecting and eliminating memory leaks using cyclic memory allocation
Proceedings of the 6th international symposium on Memory management
Universal semantic communication I
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
SIGACT news complexity theory column 64
ACM SIGACT News
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
Specifying and dynamically verifying address translation-aware memory consistency
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Software frameworks and embedded control systems
Software frameworks and embedded control systems
Incremental cryptography and memory checkers
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Concurrent reactive plans: anticipating and forestalling execution failures
Concurrent reactive plans: anticipating and forestalling execution failures
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A low complexity probabilistic test for integer multiplication
Journal of Complexity
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
An alternative polychronous model and synthesis methodology for model-driven embedded software
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
QuickCheck: a lightweight tool for random testing of Haskell programs
ACM SIGPLAN Notices
Ensuring correct self-reconfiguration in safety-critical applications by verified result checking
Proceedings of the 2011 workshop on Organic computing
Verification of certifying computations
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On robust combiners for oblivious transfer and other primitives
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A theory of goal-oriented communication
Journal of the ACM (JACM)
Higher dependability and security for mobile applications
SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing
Computer Science Review
Verifying quantitative reliability for programs that execute on unreliable hardware
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
A Framework for the Verification of Certifying Computations
Journal of Automated Reasoning
| Hi-index | 0.01 |
A program correctness checker is an algorithm for checking the output of a computation. This paper defines the concept of a program checker. It designs program checkers for a few specific and carefully chosen problems in the class P of problems solvable in polynomial time. 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. Finally it characterizes the problems that can be checked.