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 4 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.

affno abstractunlabeled
TLQSolver: A Temporal Logic Query Checker
Marsha Chećhik, Arie Gurfinkel
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Extending statecharts with process algebra operators
Marc Frappier, Frédéric Gervais, Régine Laleau, Benoît Fraikin, Richard St‐Denis
2008· article· en· Innovations in Systems and Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Temporal Logic Model Checking in Alloy
Amirhossein Vakili, Nancy A. Day
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Mining Timed Regular Specifications from System Traces
Apurva Narayan, Greta Cutulenco, Yogi Joshi, Sebastian Fischmeister
2018· article· en· ACM Transactions on Embedded Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
ΧChek: A Multi-valued Model-Checker
Marsha Chećhik, Arie Gurfinkel, Benet Devereux
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
ROCS
Yinan Li, Jun Liu
2018· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
BDD-Based Symbolic Model Checking
Sagar Chaki, Arie Gurfinkel
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Robust Vacuity for Branching Temporal Logic
Arie Gurfinkel, Marsha Chećhik
2012· article· en· ACM Transactions on Computational Logic· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Path invariants
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
2007· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Recovering and Utilizing Partial Duality in QBF
Alexandra Goultiaeva, Fahiem Bacchus
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
afffundno abstractunlabeled
Multiobjective Optimization by Decision Diagrams
David Bergman, André A. Ciré
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Stone Duality for Markov Processes
Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
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
affunlabeled
Verifying an Arbiter Circuit
Chao Yan, Mark R. Greenstreet
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
iState: A Statechart Translator
Emil Sekerinski, Rafik Zurob
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Efficient modular SAT solving for IC3
Sam Bayless, Celina G. Val, Thomas Ball, Holger H. Hoos, Alan J. Hu
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
← previousnext →

How this was built: Screen · Findings · About