MétaCan
Menu
Back to cohort
Record W2227967139

Generalizing CASL Specification Components and Preserving Rewrite Proofs

2003· article· en· W2227967139 on OpenAlex
Anamaria Martins, Christophe Ringeissen

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

VenueHAL (Le Centre pour la Communication Scientifique Directe) · 2003
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicBusiness Process Modeling and Analysis
Canadian institutionsPrevention of Organ Failure
Fundersnot available
KeywordsMathematical proofComponent (thermodynamics)Computer scienceGeneralizationParameterized complexityProgramming languageSoundnessSet (abstract data type)Specification languageTheoretical computer scienceMathematicsAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

We propose the theoretical basis of a tool for the generation of reusable CASL specification components by generalization of existing ones. The underlying idea is, given a component and a set of semantic properties that it satisfies and that we want to preserve, to find a parameterized, more general, component satisfying the following conditions: the original component is one of its possible instantiations, and any of its instantiations satisfy the stated properties. We present here both the definition of the generalization operation for CASL and the problem of preserving properties in the generalized component. To guarantee the preservation of properties, we propose to preserve their proofs, concentrating on the use of rewrite proofs. This technique provides a simple way to find sufficient conditions for the preservation of the corresponding properties. This work is being integrated in the specification component development tool FERUS, under development for the CASL language, using ELAN as the rewrite proof engine.

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.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.761
Threshold uncertainty score0.755

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
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.025
GPT teacher head0.208
Teacher spread0.183 · 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