MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Software Testing and Debugging Techniques
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

996 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
996 works in the cohort · of 4,299,418page 6 of 20

Labels cover 2 of 996 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 996 of 996 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Automated Extraction of GUI Models for Testing
Pekka Aho, Teemu Kanstrén, Tomi Räty, Juha Röning
2014· book-chapter· en· Advances in computers· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Fault Diagnosis in Extended Finite State Machines
Khaled El‐Fakih, Svetlana Prokopenko, Nina Yevtushenko, Gregor von Bochmann
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Generative AI to Generate Test Data Generators
Benoît Baudry, Khashayar Etemadi, Sen Fang, Yogya Gamage, Yi Liu, Martin Monperrus +3 more
2024· preprint· en· IEEE Software· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
Synthesizing Web Element Locators (T)
Kartik Bajaj, Karthik Pattabiraman, Ali Mesbah
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Test Case Prioritization Using Extended Digraphs
Sepideh Emam, James Miller
2015· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Cover starters for covering arrays of strength two
Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, José Torres-Jiménez
2011· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Slicer4J: a dynamic slicer for Java
Khaled E. Ahmed, Mieszko Lis, Julia Rubin
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
XAI4FL
Ratnadira Widyasari, Gede Artha Azriadi Prana, Stefanus Agus Haryono, Yuan Tian, Hafil Noer Zachiary, David Lo
2022· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Generalizing Redundancy Elimination in Checking Sequences
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, Hüsnü Yenigün
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Automated Test Case Repair Using Language Models
Ahmadreza Saboor Yaraghi, Darren Holden, Nafıseh Kahani, Lionel Briand
2025· article· en· IEEE Transactions on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
Reinforcement Learning for Test Case Prioritization
Mojtaba Bagherzadeh, Nafıseh Kahani, Lionel Briand
2021· preprint· en· IEEE Transactions on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Lower bounds on lengths of checking sequences
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün, Ji Chao Zhang
2009· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
A hybrid program slicing framework
Juergen Rilling, Bhaskar Airody Karanth
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
fundno affunlabeled
BloomUnit
Peter Alvaro, Andrew J. Hutchinson, Neil Conway, William R. Marczak, Joseph M. Hellerstein
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Dynamic Human-in-the-Loop Assertion Generation
Lucas Zamprogno, Braxton Hall, Reid Holmes, Joanne M. Atlee
2022· article· en· IEEE Transactions on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About