lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Why is unit-testing in computer games difficult?
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.ORCID iD: 0000-0001-5335-5196
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.ORCID iD: 0000-0003-1154-5308
2011 (English)In: Proceedings of the European Conference on Software Maintenance and Reengineering, CSMR / [ed] Tom Mens, Anthony Cleve, Rudolf Ferenc, IEEE, 2011, 373-378 p.Conference paper, (Refereed)
Abstract [en]

In this paper, we investigate how unit testing can be used to verify computer game simulations with implicit and poorly defined mathematical models. The difficulty of calculation of expected values for such cases tends to lead to Fragile and Obscure tests. The effects of these test smells can be reduced if we improve the strategy we use to calculate expected values. We investigate four strategies and while each of these is insufficient, we outline how they can be combined into a single, sufficient strategy.

Place, publisher, year, edition, pages
IEEE, 2011. 373-378 p.
Keyword [en]
XUnit, Unit Testing, Computer Game Testing
National Category
Computer Science
Research subject
Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-18196DOI: 10.1109/CSMR.2012.46ISBN: 978-0-7695-4666-7 (print)OAI: oai:DiVA.org:lnu-18196DiVA: diva2:513607
Conference
2012 16th European Conference on Software Maintenance and Reengineering, CSMR 2012; Szeged; Hungary; 27-30 March 2012
Available from: 2012-04-26 Created: 2012-04-03 Last updated: 2017-04-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Toll, DanielOlsson, Tobias
By organisation
School of Computer Science, Physics and Mathematics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 156 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf