Data assurance in opaque computations

Downloads

1. Hooper, D., Whyld, K.: The Oxford Companion to Chess. OUP, 2nd Edition (1992) 2. FIDE: The Laws of Chess. FIDE Handbook E.1.01A. http://www.fide.com/component/- handbook/?id=124&view=article (2009) 3. McCorduck, P.: Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence. A.K.Peters (2004) 4. Heinz, E.A.: Endgame databases and efficient index schemes. ICCA J. 22-1, 22--32 (1999) 5. Ströhlein, T.: Untersuchungen über kombinatorische Spiele. Ph.D. thesis, Technical University of Munich (1970) 6. Haworth, G.McC.: 6-man Chess Solved. ICGA J. 28-3, 153 (2005) 7. Kryukov, K.: ‘EGTs Online’. http://kirill-kryukov.com/chess/tablebases-online/ (2007) 8. Nalimov, E.V., Haworth, G.McC., Heinz, E.A.: Space-efficient indexing of chess endgame tables. ICGA J. 23-3, 148-162 (2000) 9. Nalimov, E.V.: Private Communications (2000) 10. Coe, T.: Inside the Pentium FDIV bug. Dr. Dobb’s Journal 229, 129--135 & 148 (1995) 11. Gorenstein, D., Lyons, R. Solomon R.: The Classification of Finite Simple Groups. AMS (1994). 12. Devlin, K.: Last doubts removed about the proof of the Four Color Theorem. MAA Online http://www.maa.org/devlin/devlin_01_05.html (2005) 13. RIPE: Mediterranean Cable Cut – A RIPE NCC Analysis. http://www.ripe.net/projects/- reports/2008cable-cut/index.html (2008) 14. BBC: Repairs begin on undersea cable. http://news.bbc.co.uk/1/hi/technology/7795320.stm (2008) 15. Pouzzner, D.: Partial failure of Internet root nameservers. The Risks Digest 19-25 (1997) 16. BBC: ‘Human error’ hits Google search. http://news.bbc.co.uk/1/hi/technology/7862840- .stm (2009) 17. Hurd, J.: Formal verification of chess endgame databases. In Joe Hurd, Edward Smith, and Ashish Darbari. Theorem proving in higher order logics: Emerging trends proceedings. Technical Report PRG-RR-05-02, 85-100. Oxford University Computing Laboratory (2005) 18. Shadbolt, N., Hall, W., Berners-Lee, T.: The Semantic Web Revisited. IEEE Intelligent Systems 21-3 96--101 (2006) 19. Herik, H.J. van den, Herschberg, I.S., Nakad, N.: A Six-Men-Endgame Database: KRP(a2)KbBP(a3). ICCA J. 10-4 163--180 (1987) 20. Michalski, R.S., Negri, P.G.: An Experiment on Inductive Learning in Chess End Games. Machine Intelligence 8, pp. 175-192. Ellis Horwood (1977) 21. Sattler, R.: Further to the KRP(a2)KbBP(a3) Database. ICCA J. 11-2/3, 82--87 (1988) 22. Herik, H.J. van den, Herschberg, I.S., Nakad, N.: A Reply to R. Sattler's Remarks on the KRP(a2)-KbBP(a3) Database. ICCA J. 11-2/3, 88--91 (1988) 23. Bleicher, E.: FREEZER. http://www.freezerchess.com/ (2009) 24. Andrist, R.B.: WILHELM. http://www.geocities.com/rba_schach2000/index_english.htm (2009) 25. Wu, R., Beal, D.F.: Solving Chinese Chess Endgames by Database Construction. Information Sciences 135-3/4, 207--228 (2001) 26. Wirth, C., Nievergelt, J.: Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA J. 22-2, 67--80 (1999) 27. Tay, A.: A Guide to Endgame Tablebases. http://www.horizonchess.com/FAQ/Winboard/- egtb.html (2009) 28. Merlino, J.: Regarding FEG 3.03b – List Found. http://www.horizonchess.com/FAQ/- Winboard/egdbbug.html (2002) 29. Chessbase: FRITZ ENDGAME T3. http://www.chessbase.com/workshop2.asp?id=3179 (2006) 30. Roycroft, A.J.: *C* Correction. EG 7-119, 771 (1996) 31. Roycroft, A.J.: The Computer Section: Correction. EG 8-123, 47--48 (1997) 32. Roycroft, A.J.: *C*. EG 8-130 Supplement, 428 (1998) 33. Roycroft, A.J.: Snippets. EG 8-131, 476 (1999) 34. Jones, N.D., Muchnick, S.S.: TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages. LNCS 66 (1978) 35. Bourzutschky, M.S., Tamplin, J.A., Haworth, G.McC.: Chess endgames: 6-man data and strategy. Theoretical Computer Science, Vol. 349-2, 140--157 (2005) 36. Bourzutschky, M.S.: Tablebase version comparison. http://preview.tinyurl.com/d3wny4 (2006-08-10) 37. Thompson, K.: Reflections on Trusting Trust. CACM 27-8, 761--3 (1984) 38. Tamplin, J.: EGT-query service extending to 6-man pawnless endgame EGTs in DTC, DTM, DTZ and DTZ50 metrics. http://chess.jaet.org/endings/ (2006) 39. Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the Checkers 10-piece Endgame Databases. In: Advances in Computer Games 10, pp. 193-210 (2003) 40. Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA J., 9-3, 131-139 (1986) 41. Stiller, L.B.: Parallel Analysis of Certain Endgames. ICCA J,, 12-2, 55-64 (1989) 42. Nunn, J.: Secrets of Pawnless Endings. Expanded Edition 2, Gambit (2002) 43. Krabbé, T.: Private Communication (2008-09-05) 44. Herbstman, A.O.: Draw Study 172. EG 5, 195 (1967) 45. Haworth, G.McC.: Strategies for Constrained Optimisation. ICGA J. 23-1, 9-20 (2000) 46. Byers, F.R.: Care and Handling of CDs and DVDs: A Guide for Librarians and Archivists. CLIR/NIST. See also http://www.clir.org/pubs/reports/pub121/contents.html (2003) 47. Fierz, M. Cash, M., Gilbert, E.: The 2002 World Computer-Checkers Championship. ICGA J. 25-3, 196--198 (2002) 48. Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer- Verlag, New York, N.Y. (1997) 49. Komissarchik, E.A., Futer, A.L.: Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM. Problemy Kybernet, 29, 211--220 (1974). Reissued in translation by Chr. Posthoff and I.S. Herschberg under the title ‘Computer Analysis of a Queen Endgame’. ICCA J. 9-4, 189-198 (1986) 50. Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press (1993) 51. Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67-69. Cambridge University Mathematical Laboratory (1949) 52. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2006), pp 42-54. ACM (2006). 53. Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24-3, 293-318 (1992) 54. Gordon, M.J.C.: Programming combinations of deduction and BDD-based symbolic calculation. LMS J. of Computation and Mathematics, 5, 56-76 (2002) 55. Edelkamp, S: Symbolic exploration in two-player games: Preliminary results. In The International Conference on AI Planning & Scheduling (AIPS), Workshop on Model Checking, 40-48, Toulouse, France (2002) 56. Kristensen, J.T.: Generation and compression of endgame tables in chess with fast random access using OBDDs. Master's thesis, U. of Aarhus, Dept. of Computer Science (2005) 57. Hurd, J.: Chess Endgames. http://www.gilith.com/chess/endgames (2005) 58. Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is Solved. Science 317-5844, 1518-1522 (2007)