MétaCan
Menu
Back to cohort
Record W2115655439 · doi:10.1109/icis-comsar.2006.34

Empirical Validation of Test-Driven Pair Programming in Game Development

2006· article· en· W2115655439 on OpenAlexaff
Shaochun Xu, Václav Rajlich

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsAlgoma UniversityLaurentian University
Fundersnot available
KeywordsCode refactoringPair programmingExtreme programmingComputer scienceCohesion (chemistry)Extreme programming practicesWaterfall modelVideo game developmentTest (biology)Test-driven developmentProgramming languageSoftware engineeringGame designSoftware developmentHuman–computer interactionSoftware development processSoftware

Abstract

fetched live from OpenAlex

This paper investigates the effects of some extreme programming practices in game development by conducting a case study with 12 students who were assigned to implement a simple game application either as pairs or as individuals. The pairs used some XP practices, such as pair programming, test-driven and refactoring, while the individuals applied the traditional waterfall-like approach. The results of the case study showed that paired students completed their tasks faster and with higher quality than individuals. The programs written by pairs pass more test cases than those developed by individuals. Paired programmers also wrote cleaner code with higher cohesion by creating more reasonable number of methods. Therefore, some XP practices, such as pair programming, test-driven and refactoring could be used in game development.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.175
Threshold uncertainty score0.204

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.029
GPT teacher head0.294
Teacher spread0.264 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations37
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicSoftware Engineering ResearchFrench-language works237,207