MétaCan
Menu
Back to cohort
Record W2044908638 · doi:10.1109/ccece.2008.4564709

Harnessing overgeneralization in the synthesis of state machines from scenarios

2008· article· en· W2044908638 on OpenAlex
Abdolmajid Mousavi, Behrouz H. Far

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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSpurious relationshipGeneralizationComputer scienceSet (abstract data type)SyntaxFinite-state machineState (computer science)Programming languageArtificial intelligenceMachine learningMathematics

Abstract

fetched live from OpenAlex

Synthesis of state machine designs from scenarios must cope with two main problems, namely, generalizing partial behaviours of scenarios and preventing from overgeneralization that produces spurious emergent behaviours. The challenge is a trade-off between automatic generalization in one hand, and the effort and time spent for resolving spurious emergent behaviours on the other hand. In this paper, we propose a solution for this challenge in terms of a set of syntactic criteria defined over scenarios that can be automatically checked using a syntax checker. While these criteria still allow for enough generalization in the output state machine, they also harness overgeneralization as a challenge for automatic synthesis of state machines from scenarios.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.955
Threshold uncertainty score0.822

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.024
GPT teacher head0.219
Teacher spread0.194 · 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