MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
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 2 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. 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
CSIsat: Interpolation for LA+EUF
Dirk Beyer, Damien Zufferey, Rupak Majumdar
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Comparison of Model Checking Tools for Information Systems
Marc Frappier, Benoît Fraikin, Romain Chossart, Raphaël Chane-Yack-Fa, Mohammed Ouenzar
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affunlabeled
Compositional recurrence analysis
Azadeh Farzan, Zachary Kincaid
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
afffundunlabeled
Finite LTL Synthesis as Planning
Alberto Rivas, Jorge A. Baier, Christian Muise, Sheila A. McIlraith
2018· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
afffundunlabeled
Template semantics for model-based notations
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
2003· article· en· IEEE Transactions on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
affno abstractunlabeled
Internal axioms for domain semirings
Jules Desharnais, Georg Struth
2010· article· en· Science of Computer Programming· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Formal methods: the very idea
Daniel M. Berry
2002· article· en· Science of Computer Programming· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affunlabeled
Design diagnosis using Boolean satisfiability
Alexander Smith, Andreas Veneris, Anastasios Viglas
2004· article· en· ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)· Computer Science
machine prediction:candidate · noneconsensus · none
49
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
Hierarchical Hardness Models for SAT
Lin Xu, Holger H. Hoos, Kevin Leyton‐Brown
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Checking-Up on Branch-and-Check
J. Christopher Beck
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Preprocessing QBF
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
How Vacuous Is Vacuous?
Arie Gurfinkel, Marsha Chećhik
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
BER Testing of Communication Interfaces
Yongquan Fan
2008· article· en· IEEE Transactions on Instrumentation and Measurement· Computer Science
machine prediction:candidate · noneconsensus · none
44
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
Proof-Like Counter-Examples
Arie Gurfinkel, Marsha Chećhik
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Sampling-Based Runtime Verification
Borzoo Bonakdarpour, Samaneh Navabpour, Sebastian Fischmeister
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Extending Extended Vacuity
Arie Gurfinkel, Marsha Chećhik
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Binary Clause Reasoning in QBF
Horst Samulowitz, Fahiem Bacchus
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
← previousnext →

How this was built: Screen · Findings · About