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 Aspects of Computing
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.

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

Labels cover 0 of 41 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 41 of 41 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
Contracts for concurrency
Piotr Nienaltowski, Bertrand Meyer, Jonathan S. Ostroff
2008· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
A probability perspective
Eric C. R. Hehner
2010· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
Beyond contracts for concurrency
Jonathan S. Ostroff, Faraz Torshizi, Hai Feng Huang, Bernd Schoeller
2008· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
On Formal Methods Thinking in Computer Science Education
Brijesh Dongol, Catherine Dubois, Stefan Hallerstede, Eric C. R. Hehner, Carroll Morgan, Péter Müller +4 more
2024· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Lower bounds on lengths of checking sequences
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün, Ji Chao Zhang
2009· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
On Closure UnderStuttering
Dimitrie O. Păun, Marsha Chećhik
2003· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Proving termination of nonlinear command sequences
Domagoj Babić, Byron Cook, Alan J. Hu, Zvonimir Rakamarić
2012· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Refinement patterns for ASTDs
Marc Frappier, Frédéric Gervais, Régine Laleau, Jérémy Milhau
2013· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Algebraic Composition of Function Tables
Martin v. Mohrenschildt
2000· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Simulation relations for fault-tolerance
Ramiro Demasi, Pablo F. Castro, T. S. E. Maibaum, Nazareno Aguirre
2017· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Memory Consistency and Program Transformations
Akshay Gopalakrishnan, Clark Verbrugge, Mark Batty
2025· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
Editorial
Daniel Kroening, Tiziana Margaria, Jim Woodcock
2011· editorial· es· Formal Aspects of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations

How this was built: Screen · Findings · About