Accessibility navigation

Data assurance in opaque computations

Hurd, J. and Haworth, G. M. ORCID: (2010) Data assurance in opaque computations. Lecture Notes in Computer Science, 6048. pp. 221-231. ISSN 0302-9743

Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/978-3-642-12993-3_20


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.

Item Type:Article
ID Code:4515
Additional Information:12th International Conference on Advances in Computer Games (ACG 2009) Pamplona, SPAIN 11-13 May 2009
Publisher Statement:The original publication is available at


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation