{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:59:51Z","timestamp":1725555591263},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_20","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T08:43:37Z","timestamp":1272962617000},"page":"221-231","source":"Crossref","is-referenced-by-count":1,"title":["Data Assurance in Opaque Computations"],"prefix":"10.1007","author":[{"given":"Joe","family":"Hurd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Haworth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Hooper, D., Whyld, K.: The Oxford Companion to Chess, 2nd edn. OUP (1992)"},{"key":"20_CR2","unstructured":"FIDE: The Laws of Chess. FIDE Handbook E.1.01A (2009), http:\/\/www.fide.com\/component\/-handbook\/?id=124&view=article"},{"key":"20_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/9780429258985","volume-title":"Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence","author":"P. McCorduck","year":"2004","unstructured":"McCorduck, P.: Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence. A.K.Peters, Wellesley (2004)"},{"issue":"1","key":"20_CR4","first-page":"22","volume":"22","author":"E.A. Heinz","year":"1999","unstructured":"Heinz, E.A.: Endgame databases and efficient index schemes. ICCA J.\u00a022(1), 22\u201332 (1999)","journal-title":"ICCA J."},{"key":"20_CR5","unstructured":"Str\u00f6hlein, T.: Untersuchungen \u00fcber kombinatorische Spiele. Ph.D. thesis, Technical University of Munich (1970)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Haworth, G.M c C.: 6-man Chess Solved. ICGA J.\u00a028(3), 153 (2005)","DOI":"10.3233\/ICG-2005-28304"},{"key":"20_CR7","unstructured":"Kryukov, K.: EGTs Online (2007), http:\/\/kirill-kryukov.com\/chess\/tablebases-online\/"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Nalimov, E.V., Haworth, G.M c C., Heinz, E.A.: Space-efficient indexing of chess endgame tables. ICGA J.\u00a023(3), 148\u2013162 (2000)","DOI":"10.3233\/ICG-2000-23304"},{"key":"20_CR9","unstructured":"Nalimov, E.V.: Private Communications (2000)"},{"key":"20_CR10","first-page":"129","volume":"229","author":"T. Coe","year":"1995","unstructured":"Coe, T.: Inside the Pentium FDIV bug. Dr. Dobb\u2019s Journal\u00a0229, 129\u2013135, 148 (1995)","journal-title":"Dr. Dobb\u2019s Journal"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Gorenstein, D., Lyons, R., Solomon, R.: The Classification of Finite Simple Groups. AMS (1994)","DOI":"10.1090\/surv\/040.1"},{"key":"20_CR12","unstructured":"Devlin, K.: Last doubts removed about the proof of the Four Color Theorem (2005), http:\/\/www.maa.org\/devlin\/devlin_01_05.html"},{"key":"20_CR13","unstructured":"RIPE: Mediterranean Cable Cut \u2013 A RIPE NCC Analysis (2008), http:\/\/www.ripe.net\/projects\/-reports\/2008cable-cut\/index.html"},{"key":"20_CR14","unstructured":"BBC: Repairs begin on undersea cable (2008), http:\/\/news.bbc.co.uk\/1\/hi\/technology\/7795320.stm"},{"key":"20_CR15","unstructured":"Pouzzner, D.: Partial failure of Internet root nameservers. The Risks Digest, 19\u201325 (1997)"},{"key":"20_CR16","unstructured":"BBC: Human error\u2019 hits Google search (2009), http:\/\/news.bbc.co.uk\/1\/hi\/technology\/7862840-.stm"},{"key":"20_CR17","unstructured":"Hurd, J.: Formal verification of chess endgame databases. In: Hurd, J., Smith, E., Darbari, A. (eds.) Theorem proving in higher order logics: Emerging trends proceedings. Technical Report PRG-RR-05-02, 85-100. Oxford University Computing Laboratory (2005)"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/MIS.2006.62","volume":"21","author":"N. Shadbolt","year":"2006","unstructured":"Shadbolt, N., Hall, W., Berners-Lee, T.: The Semantic Web Revisited. IEEE Intelligent Systems\u00a021(3), 96\u2013101 (2006)","journal-title":"IEEE Intelligent Systems"},{"issue":"4","key":"20_CR19","first-page":"163","volume":"10","author":"H.J. Herik","year":"1987","unstructured":"Herik, H.J., van den Herschberg, I.S., Nakad, N.: A Six-Men-Endgame Database: KRP(a2)KbBP(a3). ICCA J.\u00a010(4), 163\u2013180 (1987)","journal-title":"ICCA J."},{"key":"20_CR20","unstructured":"Michalski, R.S., Negri, P.G.: An Experiment on Inductive Learning in Chess End Games. In: Machine Intelligence, vol.\u00a08, pp. 175\u2013192. Ellis Horwood (1977)"},{"issue":"2\/3","key":"20_CR21","first-page":"82","volume":"11","author":"R. Sattler","year":"1988","unstructured":"Sattler, R.: Further to the KRP(a2)KbBP(a3) Database. ICCA J.\u00a011(2\/3), 82\u201387 (1988)","journal-title":"ICCA J."},{"issue":"2\/3","key":"20_CR22","first-page":"88","volume":"11","author":"H.J. Herik","year":"1988","unstructured":"Herik, H.J., van den Herschberg, I.S., Nakad, N.: A Reply to R. Sattler\u2019s Remarks on the KRP(a2)-KbBP(a3) Database. ICCA J.\u00a011(2\/3), 88\u201391 (1988)","journal-title":"ICCA J."},{"key":"20_CR23","unstructured":"Bleicher, E.: Freezer (2009), http:\/\/www.freezerchess.com\/"},{"key":"20_CR24","unstructured":"Andrist, R.B.: Wilhelm (2009), http:\/\/www.geocities.com\/rba_schach2000\/index_english.htm"},{"issue":"3\/4","key":"20_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0255(01)00137-2","volume":"135","author":"R. Wu","year":"2001","unstructured":"Wu, R., Beal, D.F.: Solving Chinese Chess Endgames by Database Construction. Information Sciences\u00a0135(3\/4), 207\u2013228 (2001)","journal-title":"Information Sciences"},{"issue":"2","key":"20_CR26","first-page":"67","volume":"22","author":"C. Wirth","year":"1999","unstructured":"Wirth, C., Nievergelt, J.: Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA J.\u00a022(2), 67\u201380 (1999)","journal-title":"ICCA J."},{"key":"20_CR27","unstructured":"Tay, A.: A Guide to Endgame Tablebases (2009), http:\/\/www.horizonchess.com\/FAQ\/Winboard\/-egtb.html"},{"key":"20_CR28","unstructured":"Merlino, J.: Regarding FEG 3.03b \u2013 List Found (2002), http:\/\/www.horizonchess.com\/FAQ\/-Winboard\/egdbbug.html"},{"key":"20_CR29","unstructured":"Chessbase: FRITZ ENDGAME T3 (2006), http:\/\/www.chessbase.com\/workshop2.asp?id=3179"},{"issue":"119","key":"20_CR30","first-page":"771","volume":"7","author":"A.J. Roycroft","year":"1996","unstructured":"Roycroft, A.J.: *C* Correction. EG\u00a07(119), 771 (1996)","journal-title":"EG"},{"issue":"123","key":"20_CR31","first-page":"47","volume":"8","author":"A.J. Roycroft","year":"1997","unstructured":"Roycroft, A.J.: The Computer Section: Correction. EG\u00a08(123), 47\u201348 (1997)","journal-title":"EG"},{"issue":"Suppl. 130","key":"20_CR32","first-page":"428","volume":"8","author":"A.J. Roycroft","year":"1998","unstructured":"Roycroft, A.J.: *C*. EG\u00a08(Suppl. 130), 428 (1998)","journal-title":"EG"},{"issue":"131","key":"20_CR33","first-page":"476","volume":"8","author":"A.J. Roycroft","year":"1999","unstructured":"Roycroft, A.J.: Snippets. EG\u00a08(131), 476 (1999)","journal-title":"EG"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"TEMPO","year":"1978","unstructured":"Jones, N.D., Muchnick, S.S. (eds.): TEMPO. LNCS, vol.\u00a066. Springer, Heidelberg (1978)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Bourzutschky, M.S., Tamplin, J.A., Haworth, G.M c C.: Chess endgames: 6-man data and strategy. Theoretical Computer Science\u00a0349(2), 140\u2013157 (2005)","DOI":"10.1016\/j.tcs.2005.09.043"},{"key":"20_CR36","unstructured":"Bourzutschky, M.S.: Tablebase version comparison, http:\/\/preview.tinyurl.com\/d3wny4 (2006-08-10)"},{"issue":"8","key":"20_CR37","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/358198.358210","volume":"27","author":"K. Thompson","year":"1984","unstructured":"Thompson, K.: Reflections on Trusting Trust. CACM\u00a027(8), 761\u2013763 (1984)","journal-title":"CACM"},{"key":"20_CR38","unstructured":"Tamplin, J.: EGT-query service extending to 6-man pawnless endgame EGTs in DTC, DTM, DTZ and DTZ50 metrics (2006), http:\/\/chess.jaet.org\/endings\/"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the Checkers 10-piece Endgame Databases. In: Advances in Computer Games, vol.\u00a010, pp. 193\u2013210 (2003)","DOI":"10.1007\/978-0-387-35706-5_13"},{"issue":"3","key":"20_CR40","first-page":"131","volume":"9","author":"K. Thompson","year":"1986","unstructured":"Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA J.\u00a09(3), 131\u2013139 (1986)","journal-title":"ICCA J."},{"issue":"2","key":"20_CR41","first-page":"55","volume":"12","author":"L.B. Stiller","year":"1989","unstructured":"Stiller, L.B.: Parallel Analysis of Certain Endgames. ICCA J.\u00a012(2), 55\u201364 (1989)","journal-title":"ICCA J."},{"key":"20_CR42","unstructured":"Nunn, J.: Secrets of Pawnless Endings, 2nd Expanded edn., Gambit (2002)"},{"key":"20_CR43","unstructured":"Krabb\u00e9, T.: Private Communication (2008-09-05)"},{"key":"20_CR44","first-page":"195","volume":"5","author":"A.O. Herbstman","year":"1967","unstructured":"Herbstman, A.O.: Draw Study 172. EG\u00a05, 195 (1967)","journal-title":"EG"},{"key":"20_CR45","doi-asserted-by":"crossref","unstructured":"Haworth, G.M c C.: Strategies for Constrained Optimisation. ICGA J.\u00a023(1), 9\u201320 (2000)","DOI":"10.3233\/ICG-2000-23103"},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"Byers, F.R.: Care and Handling of CDs and DVDs: A Guide for Librarians and Archivists. CLIR\/NIST (2003), http:\/\/www.clir.org\/pubs\/reports\/pub121\/contents.html","DOI":"10.6028\/NIST.SP.500-252"},{"issue":"3","key":"20_CR47","doi-asserted-by":"crossref","first-page":"196","DOI":"10.3233\/ICG-2002-25325","volume":"25","author":"M. Fierz","year":"2002","unstructured":"Fierz, M., Cash, M., Gilbert, E.: The 2002 World Computer-Checkers Championship. ICGA J.\u00a025(3), 196\u2013198 (2002)","journal-title":"ICGA J."},{"key":"20_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2733-3","volume-title":"One Jump Ahead: Challenging Human Supremacy in Checkers","author":"J. Schaeffer","year":"1997","unstructured":"Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, New York (1997)"},{"issue":"4","key":"20_CR49","first-page":"211","volume":"29","author":"E.A. Komissarchik","year":"1974","unstructured":"Komissarchik, E.A., Futer, A.L.: Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM. Problemy Kybernet\u00a029, 211\u2013220 (1974); Reissued in translation by Chr. Posthoff and I.S. Herschberg under the title \u2018Computer Analysis of a Queen Endgame. ICCA J.\u00a09(4), 189\u2013198 (1986)","journal-title":"Problemy Kybernet"},{"key":"20_CR50","volume-title":"Introduction to HOL: A theorem-proving environment for higher order logic","author":"M.J.C. Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press, Cambridge (1993)"},{"key":"20_CR51","unstructured":"Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67\u201369. Cambridge University Mathematical Laboratory (1949)"},{"key":"20_CR52","first-page":"42","volume-title":"Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2006)","author":"X. Leroy","year":"2006","unstructured":"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\u201354. ACM, New York (2006)"},{"issue":"3","key":"20_CR53","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"20_CR54","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1112\/S1461157000000693","volume":"5","author":"M.J.C. Gordon","year":"2002","unstructured":"Gordon, M.J.C.: Programming combinations of deduction and BDD-based symbolic calculation. LMS J. of Computation and Mathematics\u00a05, 56\u201376 (2002)","journal-title":"LMS J. of Computation and Mathematics"},{"key":"20_CR55","unstructured":"Edelkamp, S.: Symbolic exploration in two-player games: Preliminary results. In: The International Conference on AI Planning & Scheduling (AIPS), Workshop on Model Checking, Toulouse, France, pp. 40\u201348 (2002)"},{"key":"20_CR56","unstructured":"Kristensen, J.T.: Generation and compression of endgame tables in chess with fast random access using OBDDs. Master\u2019s thesis, U. of Aarhus, Dept. of Computer Science (2005)"},{"key":"20_CR57","unstructured":"Hurd, J.: Chess Endgames (2005), http:\/\/www.gilith.com\/chess\/endgames"},{"issue":"5844","key":"20_CR58","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J. Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is Solved. Science\u00a0317(5844), 1518\u20131522 (2007)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12993-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T04:08:44Z","timestamp":1591243724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}