Are there interactive protocols for CO-NP languages?
Information Processing Letters
Programming pearls
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
Efficient checking of computations
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Coherent functions and program checkers
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
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A mathematical theory of self-checking, self-testing and self-correcting programs
A mathematical theory of self-checking, self-testing and self-correcting programs
Batch checking with applications to linear functions
Information Processing Letters
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods in hardware/software testing
Algebraic methods in hardware/software testing
Highly resilient correctors for polynomials
Information Processing Letters
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
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
On being incoherent without being very hard
Computational Complexity
Testing multivariate linear functions: overcoming the generator bottleneck
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reflections on the Pentium Division Bug
IEEE Transactions on Computers
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
The Infeasibility of Quantifying the Reliability of Life-Critical Real-Time Software
IEEE Transactions on Software Engineering
Error Detection and Correction in Numerical Computations by Algebraic Methods
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Self-Testing without the Generator Bottleneck
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Reliable and efficient matrix processing with the specification-consistent coordination model
Proceedings of the 1999 ACM symposium on Applied computing
Specification-consistent coordination model for computations
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A certifying compiler for Java
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Dynamically Discovering Likely Program Invariants to Support Program Evolution
IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
On-line fault detection in a hardware/software co-design environment: system partitioning
Proceedings of the 14th international symposium on Systems synthesis
Low-Cost Error Containment and Recovery for Onboard Guarded Software Upgrading and Beyond
IEEE Transactions on Computers - Special issue on fault-tolerant embedded systems
Automatic Generation of Test Oracles—From Pilot Studies to Application
Automated Software Engineering
Reliability Properties Assessment at System Level: A Co-Design Framework
Journal of Electronic Testing: Theory and Applications
Watermarking, tamper-proffing, and obfuscation: tools for software protection
IEEE Transactions on Software Engineering
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-Detection by Result-Checking for the Eigenproblem
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Scalable Parallel Program Debugging with Process Isolation and Grouping
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
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
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
Secure Distributed Computing in a Commercial Environment
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
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
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
Fault-Tolerant High-Performance Matrix Multiplication: Theory and Practice
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Assume-Guarantee Algorithms for Automatic Detection of Software Failures
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Hardening Functions for Large Scale Distributed Computations
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Runtime verification of .NET contracts
Journal of Systems and Software - Special issue on: Component-based software engineering
The reliable algorithmic software challenge RASC
Computer Science in Perspective
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The design and implementation of a certifying compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
LISA '98 Proceedings of the 12th USENIX conference on System administration
Reliable System Specification for Self-Checking Data-Paths
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Assessing Fault Sensitivity in MPI Applications
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
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
Proceedings of the 2nd conference on Computing frontiers
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
CycleMeter: detecting fraudulent peers in internet cycle sharing
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Specification-correct and scalable coordination of Grid applications
Future Generation Computer Systems
Discrete Applied Mathematics
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 (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
Collusion Detection for Grid Computing
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
AN-Encoding Compiler: Building Safety-Critical Systems with Commodity Hardware
SAFECOMP '09 Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security
Parallelizing Software-Implemented Error Detection
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Discrete Applied Mathematics
Deductive Runtime Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Group-based adaptive result certification mechanism in Desktop Grids
Future Generation Computer Systems
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Checking value-sensitive data structures in sublinear space
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Live forensics framework for wireless sensor nodes using sandboxing
Proceedings of the 6th ACM workshop on QoS and security for wireless and mobile networks
Assigning applications to servers: a simulation study
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
ANB- and ANBDmem-encoding: detecting hardware errors in software
SAFECOMP'10 Proceedings of the 29th international conference on Computer safety, reliability, and security
Certified result checking for polyhedral analysis of bytecode programs
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Proceedings of the tenth international conference on Aspect-oriented software development
Ensuring correct self-reconfiguration in safety-critical applications by verified result checking
Proceedings of the 2011 workshop on Organic computing
Experiences with the design of a run-time check
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
A metabolic approach to protocol resilience
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
On the effectiveness of run-time checks
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Secure remote execution of sequential computations
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Computer Science Review
Software encoded processing: building dependable systems with commodity hardware
SAFECOMP'07 Proceedings of the 26th international conference on Computer Safety, Reliability, and Security
Convergence analysis of evolutionary algorithms in the presence of crash-faults and cheaters
Computers & Mathematics with Applications
| Hi-index | 0.00 |
We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed.