MétaCan
Menu
Back to cohort
Record W1984287808

Metamodelling with formal semantics with application to access control specification

2015· article· en· W1984287808 on OpenAlexaff
Jamal Abd-Ali, Karim El Guemhioui, Luigi Logrippo

Bibliographic record

VenueInternational Conference on Model-Driven Engineering and Software Development · 2015
Typearticle
Languageen
FieldSocial Sciences
TopicAccess Control and Trust
Canadian institutionsUniversité du Québec en Outaouais
Fundersnot available
KeywordsMetamodelingComputer scienceProgramming languageFormal semantics (linguistics)Semantics (computer science)Formal specificationFormalism (music)Visual modelingFormal methodsDomain (mathematical analysis)Software engineeringTheoretical computer scienceUnified Modeling LanguageSoftwareMathematics
DOInot available

Abstract

fetched live from OpenAlex

The visual aspect of metamodelling languages is an efficient lever to deal with the complexity of specifying systems. In many application domains, these systems are generally characterized by the sensitivity and criticality of their contents, hence precision and formalism are essential goals. This paper considers the domain of access control specification languages and proposes a metamodelling paradigm with capabilities for specifying both semantics and structuring elements. We describe how to specify semantics of domain specific systems at the metamodel and model levels. The paradigm defines reusable rules allowing mapping the models, including their semantics, to first order logic programs. It represents a methodical approach to elaborate domain specific languages endowed with visual aspects and means of reasoning on formal specifications. The paradigm is applicable to a wide range of systems. We show in this paper its application in the area of decision systems.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.039

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.002
Science and technology studies0.0010.006
Scholarly communication0.0050.007
Open science0.0020.004
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0020.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.051
GPT teacher head0.292
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueInternational Conference on Model-Driven Engineering and Software DevelopmentSame topicAccess Control and TrustFrench-language works237,207