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

affunlabeled
Properties and scopes in web model checking
May Haydar, Sergiy Boroday, Alexandre Petrenko, Houari Sahraoui
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Directed Reachability for Infinite-State Systems
Michael Blondin, Christoph Haase, Philip Offtermatt
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Minimum Witnesses for Unsatisfiable 2CNFs
Joshua Buresh-Oppenheim, David G. M. Mitchell
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Points-to analysis using BDDs
Marc Berndl, Ondřej Lhoták, Feng Qian, Laurie Hendren, Navindra Umanee
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Exploiting Circuit Representations in QBF Solving
Alexandra Goultiaeva, Fahiem Bacchus
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Finding Environment Guarantees
Marsha Chećhik, Mihaela Gheorghiu, Arie Gurfinkel
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
The SDEval benchmarking toolkit
Albert Heinle, Viktor Levandovskyy
2015· article· en· ACM communications in computer algebra· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Progressive Solutions to a Parallel Automata Equation
Sergey Buffalov, Khaled El‐Fakih, Nina Yevtushenko, Gregor von Bochmann
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
What can we monitor over unreliable channels?
Sean Kauffman, Klaus Havelund, Sebastian Fischmeister
2021· article· en· International Journal on Software Tools for Technology Transfer· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
IC3 - Flipping the E in ICE
Yakir Vizel, Arie Gurfinkel, Sharon Shoham, Sharad Malik
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Abstract Model Repair
George Chatzieleftheriou, Borzoo Bonakdarpour, Panagiotis Katsaros, Scott A. Smolka
2015· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
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
HOW MANY TESTS ARE ENOUGH?
Tim Menzies, Bojan Čukić
2002· book-chapter· en· World Scientific Publishing Company eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Debugging RTL Using Structural Dominance
Hratch Mangassarian, Long Bao Le, Andreas Veneris
2014· article· en· IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Online Reset for Signal Temporal Logic Monitoring
Zhenya Zhang, Paolo Arcaini, Xuan Xie
2022· article· en· IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Model checking of a real ATM switch
Jianping Lu, Sofiène Tahar, D. Voicu, Xiaoyu Song
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Generating In-Line Monitors for Rabin Automata
Hugues Chabot, Raphaël Khoury, Nadia Tawbi
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
← previousnext →

How this was built: Screen · Findings · About