M. Blum
M. Luby
R. Rubinfeld
- Adleman, L., Huang, M., Kompella, K., "Efficient Checkers for Number-Theoretic Computations", Submitted to Information and Computation. Google Scholar
Digital Library
- Beaver, D., Feigenbaum, J., "Hiding Instance in Multioracle Queries", STA CS 1990. Google ScholarDigital Library
- Ben-Or, M., Coppersmith, D., Luby, M., Rubinfeld, R., "Convolutions on Groups", rough manuscript.Google Scholar
- Blum, M., "Designing programs to check their work", Submitted to CACM.Google Scholar
- Blum, M., Kannan, S., "Program correctness checking .. and the design of programs that check their work", STOC 1989. Google ScholarDigital Library
- Blum, M., Luby, M., Rubinfeld, R., "Program Result Checking Against Adaptive Programs and in Cryptographic Settings", DIMA CS workshop on cryptography and distributed systems, 1989.Google Scholar
- Blum, M., and Micali, S., "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits", SIAM J. on Computing, Vol. 13, 1984, pp. 850-864, FOCS 1982. Google ScholarDigital Library
- Feigenbaum, J., Kannan, S., Nisan, N., "Lower Bounds on Random-Self-Reducibility", Structures in Complexity Theory, 1990.Google Scholar
- Freivalds, R., "Fast Probabilistic Algorithms", Springer Verlag Lecture Notes in CS No. 74, Mathematical Foundations of CS, 57-69 (1979).Google Scholar
- Kaminski, Michael, "A note on probabilistically verifying integer and polynomial products," JACM, Vol. 36, No. 1, January 1989, pp.142-149. Google ScholarDigital Library
- Kannan, S., "Program Result Checking with Applications", Ph.D. thesis, U.C. Berkeley, 1990.Google Scholar
- Lipton, R., "New directions in testing", manuscript.Google Scholar
- Randall, D., "Efficient Random Generation of Invertible Matrices", personal communication.Google Scholar
- Rubinfeld, R., "Designing Checkers for Programs that Run in Parallel", manuscript, 1989.Google Scholar
- Rubinfeld, R. "Batch Checking for the Mod Function", manuscript, 1990.Google Scholar
- Yao, A., "Coherent Functions and Program Checking", these proceedings. Google ScholarDigital Library
Index Terms
- Self-testing/correcting with applications to numerical problems
Recommendations
Self-Checked Metamorphic Testing of an Image Processing Program
SSIRI '10: Proceedings of the 2010 Fourth International Conference on Secure Software Integration and Reliability ImprovementMetamorphic testing is an effective technique for testing systems that do not have test oracles, for which it is practically impossible to know the correct output of an arbitrary test input. In metamorphic testing, instead of checking the correctness of ...
Automatic test generation for mutation testing on database applications
AST '13: Proceedings of the 8th International Workshop on Automation of Software TestTo assure high quality of database applications, testing database applications remains the most popularly used approach. In testing database applications, tests consist of both program inputs and database states. Assessing the adequacy of tests allows ...
Testing web applications
Traditional testing techniques are not adequate for web-based applications, since they miss their additional features such as their multi-tier nature, hyperlink-based structure, and event-driven feature. Limited work has been done on testing web ...
Comments