A. C.-C. Yao
- AFK.M. Abadi, J. Feigenbaum, and J. Kilian, "On hiding information from an oracle," Journal of Computer and System Sciences, 39 (1989), 21-50. Google Scholar
Digital Library
- AL.D. Angluin and D. Lichtenstein, "Provable security of cryptosystems: a survey," Technical Report TR-288, Yale University, October 1983.Google Scholar
- BeaF.D. Beaver and J. Feigembaum, "Hiding instances in multioracle queries," Proceedings of the 7th Symposium on Theoretical Aspects of Computer Science, Springer-Verlag LNCS 415, edited by C. Choffrut and T. Lengauer, 1990, 37-48. Google ScholarDigital Library
- BeiF.R. Beigel and J. Feigenbaum, "On the complexity of coherent functions," private communication, February 1990.Google Scholar
- BK.M. Blum and S. Kannan, "Designing programs that check their work," Proceedings 21st ACM Symposium on Theory of Computing, May 1989, 86-97. Google ScholarDigital Library
- BLR.M. Blum, M. Luby, and R. Rubinfeld, "Stronger checkers and general techniques for numerical problems," a talk presented in the DIMACS Workshop on Cryptography and Distributed Computing, Princeton, October 1989.Google Scholar
- FKN.J. Feigenbaum, S. Kannan, and N. Nisan, "Lower bounds on random-selfreducibility," to appear in Proceedings of Structures 90.Google Scholar
- F.M.L. Fredman, "How good is the information theory bound in sorting," Theoretical Computer Science 1(1976), 355-361.Google ScholarCross Ref
- GGM.O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," Journal of the ACM 33 (1986), 792-807. Google ScholarDigital Library
- H.M.E. Hellman, "A cryptanalytic timememory trade-off," IEEE Transactions on Information Theory 26 (1980), 401-405.Google ScholarDigital Library
- KK.C. Kenyon-Mathieu and V. King, "Verifying partial orders," Proceedings elst ACM Symposium on Theory of Computing, May 1989, 367-374. Google ScholarDigital Library
- K.V. King, "An optimal randomized algorithm for set-maxima," private communication, 1989.Google Scholar
- L.R.J. Lipton, "New directions in testing," manuscript and a talk presented in the DIMACS Workshop on Cryptography and Distributed Computing, Princeton, October 1989.Google Scholar
- MT.U. Manber and M. Tompa,"The complexity of problems on probabilistic, nondeterministic and alternating decision trees," Journal of ACM 32 (1985), 720-732. Google ScholarDigital Library
- Sch.A. Schonhage, "The production of partial orders," Asterisque 38-39 (1976), 229-246.Google Scholar
- SS.A. Shamir and J. Spencer, private communication, 1979.Google Scholar
- Y1.A.C. Yao, "Probabilistic computations: towards a unified measure of complexity," Proceedings 18th Annual IEEE Symposium on Foundations of Computer Science, October 1977, 222-227.Google Scholar
- Y2.A.C. Yao, "On the complexity of partial order productions," SIAM Journal on Computing 18 (1989), 679-689. Google ScholarDigital Library
Index Terms
- Coherent functions and program checkers
Recommendations
Certifying Model Checkers
CAV '01: Proceedings of the 13th International Conference on Computer Aided VerificationModel Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample computation if the check fails. This computation acts as a "certificate" of ...
Vacuity analysis for property qualification by mutation of checkers
DATE '10: Proceedings of the Conference on Design, Automation and Test in EuropeThe paper tackles the problem of property qualification focusing in particular on the identification of vacuous properties. It proposes a methodology based on a combination of dynamic and static techniques that, given a set of properties defined to ...
Analog property checkers: a DDR2 case study
The formal specification component of verification can be exported to simulation through the idea of property checkers. The essence of this approach is the automatic construction of an observer from the specification in the form of a program that can be ...
Comments