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
Formal Methods in System Design
Topic
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.

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

Labels cover 0 of 28 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 28 of 28 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.

afffundno abstractunlabeled
Explaining counterexamples using causality
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigail Orni, Richard Trefler
2011· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
104
citations
affno abstractunlabeled
Runtime enforcement of timed properties revisited
Srinivas Pinisetty, Ylìès Falcone, Thierry Jéron, Hervé Marchand, Antoine Rollet, Omer Nguena Timo
2014· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Data structures for symbolic multi-valued model-checking
Marsha Chećhik, Arie Gurfinkel, Benet Devereux, Albert Lai, Steve Easterbrook
2006· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Hazard Algebras
Janusz Brzozowski, Zoltán Ésik
2003· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Time-triggered runtime verification
Borzoo Bonakdarpour, Samaneh Navabpour, Sebastian Fischmeister
2013· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Formalization of Fixed-Point Arithmetic in HOL
Behzad Akbarpour, Sofiène Tahar, Abdelkader Dekdouk
2005· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Inferring event stream abstractions
Sean Kauffman, Klaus Havelund, Rajeev Joshi, Sebastian Fischmeister
2018· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Delay-Insensitivity and Semi-Modularity
Janusz Brzozowski, Hao Zhang
2000· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Model checking approach to automated planning
Yi Li, Jin Song Dong, Jing Sun, Yang Liu, Jun Sun
2013· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Providing a formal linkage between MDG and HOL
Haiyan Xiong, Paul Curzon, Sofiène Tahar, Ann Blandford
2006· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Rounding meets approximate model counting
Jiong Yang, Kuldeep S. Meel
2025· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A scalable entropy estimator
Priyanka Golia, Brendan Juba, Kuldeep S. Meel
2025· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About