MétaCan
Menu
Back to cohort
Record W2149274174 · doi:10.11575/prism/31115

An Implementation of Declarative Event Patterns

2004· article· en· W2149274174 on OpenAlex
Kevin Viggers, Robert J. Walker

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenuePRISM (University of Calgary) · 2004
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Software Engineering Methodologies
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAspectJComputer scienceProgramming languageAspect-oriented programmingJavaEvent (particle physics)Context (archaeology)Design by contractSoftware engineeringSoftware developmentSoftware

Abstract

fetched live from OpenAlex

ion to be expressed as context-free patterns of events, and for the occurrences of these patterns to alter the course of the program s execution. As a companion to a conference paper introducing DEPs, this technical report covers an initial realization of our declarative event pattern language that leverages the power and applicability of aspect-oriented programming (AOP). We have added to AspectJ (a popular Java implementation of AOP) two straight forward language constructs to support the recognition of patterns of events. Our proof-of-concept implementation takes programs implemented in AspectJ augmented with our DEP constructs and translates them into programs implemented in standard AspectJ, equipped to recognize and respond to patterns of events as they occur in the execution of the system.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.909
Threshold uncertainty score0.296

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.022
GPT teacher head0.279
Teacher spread0.257 · 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