Data assurance in opaque computations

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data 'model' of itself. It is vital that such models are clearly faithful to the reality they purport to represent. This paper examines that issue and systems engineering responses to it, using the chess endgame as the exemplar scenario. A structured survey has been carried out of the intrinsic challenges and complexity of creating endgame data by reviewing the past pattern of errors during work in progress, surfacing in publications and occurring after the data was generated. Specific measures are proposed to counter observed classes of error-risk, including a preliminary survey of techniques for using state-of-the-art verification tools to generate EGTs that are correct by construction. The approach may be applied generically beyond the game domain. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hurd, J., & Haworth, G. (2010). Data assurance in opaque computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6048 LNCS, pp. 221–231). https://doi.org/10.1007/978-3-642-12993-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free