MétaCan
Menu
Back to cohort
Record W2114770958 · doi:10.1109/qsic.2007.4385506

An Approach to Integration Testing of Object-Oriented Programs

2007· article· en· W2114770958 on OpenAlexafffund
Zhe Li, T. S. E. Maibaum

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Testing and Debugging Techniques
Canadian institutionsMcMaster University
FundersFonds pour la Formation à la Recherche dans l’Industrie et dans l’AgricultureMcMaster University
KeywordsComputer scienceUnified Modeling LanguageProgramming languageReuseObject-oriented programmingTest caseImplementationSoftware engineeringObject (grammar)Design by contractClass (philosophy)Component (thermodynamics)SoftwareSoftware developmentArtificial intelligenceSoftware constructionMachine learningEngineering

Abstract

fetched live from OpenAlex

Object-oriented programming has some unique features which facilitate software reuse and component-based de- velopment. However, testing object-oriented programs us- ing only traditional techniques is unlikely to find the faults caused by these features. The problem is that few integra- tion testing techniques have been systematically studied or defined. We present a novel approach to generate and exe- cute test cases for object-oriented programs from UML di- agrams. We have designed an approach to implement test cases using the concept of Coordination Contract. A Coor- dination Contract, related to the idea of the active associ- ation class in UML, defines connections among a group of objects without interfering with their implementations. By using the contract, test case generation and execution can be completed automatically. A prototype tool has been de- veloped to automatically derive the contracts based on the mechanism of test case generation mentioned above.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0020.001

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.045
GPT teacher head0.298
Teacher spread0.253 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

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

Citations13
Published2007
Admission routes2
Has abstractyes

Explore more

Same topicSoftware Testing and Debugging TechniquesFrench-language works237,207