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
Year range
Sort
Language
Type
Field
Venue
Topic
Formal Methods in Verification
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.

1,244 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.
1,244 works in the cohort · of 4,299,418page 1 of 25

Labels cover 3 of 1,244 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 1,244 of 1,244 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
The ASTREÉ Analyzer
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
392
citations
affno abstractunlabeled
Metrics for labelled Markov processes
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
309
citations
affunlabeled
Labelled Markov Processes
2009· book· en· IMPERIAL COLLEGE PRESS eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
219
citations
affno abstractunlabeled
Optimal Paths in Weighted Timed Automata
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
209
citations
affunlabeled
Multi-valued symbolic model-checking
2003· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
distilled prediction:candidate · noneconsensus · none
188
citations
affunlabeled
Points-to analysis using BDDs
2003· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
188
citations
affno abstractunlabeled
New directions in fuzzy automata
2004· article· en· International Journal of Approximate Reasoning· Computer Science
distilled prediction:candidate · noneconsensus · none
149
citations
affunlabeled
Points-to analysis using BDDs
2003· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
141
citations
affunlabeled
Formal Verification Methods
2014· book-chapter· en· Advances in information quality and management· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
108
citations
afffundno abstractunlabeled
Explaining counterexamples using causality
2011· article· en· Formal Methods in System Design· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
104
citations
affunlabeled
Data flow testing as model checking
2003· article· en· ScholarlyCommons (University of Pennsylvania)· Computer Science
distilled prediction:candidate · noneconsensus · none
90
citations
affno abstractunlabeled
Beautiful Interpolants
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
75
citations
affno abstractunlabeled
Explaining Counterexamples Using Causality
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
72
citations
affno abstractunlabeled
Model-Checking Over Multi-Valued Logics
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
69
citations

How this was built: Screen · Findings · About