MétaCan
Menu
Back to cohort
Record W2158425043 · doi:10.1109/ccece.2005.1557126

Formal approaches to requirements engineering: from behavior trees to alloy

2006· article· en· W2158425043 on OpenAlex

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Software Engineering Methodologies
Canadian institutionsUniversité du Québec en OutaouaisUniversity of Ottawa
Fundersnot available
KeywordsSoundnessComputer scienceConsistency (knowledge bases)Formal specificationCompleteness (order theory)Requirements engineeringFormal methodsSoftware engineeringRequirements analysisProgramming languageFormal verificationSemantics (computer science)Theoretical computer scienceSoftwareArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Requirements modeling is receiving a good deal of attention from the software engineering community. However, the lack of formal representation and tool support is hindering the power of many promising requirements modeling approaches. Behavior trees are no exception. This graphical approach to requirements engineering advocates building a software system from its set of requirements, rather than building a system that satisfies its requirements. In this paper, we present an approach to formalize and analyze behavior tree models using the alloy constraint language, which is based on first order logic and set theory. The defined semantics interpretations of behavior trees provide a precise and rigorous formal basis for checking the consistency, completeness, and soundness of system requirements.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.816
Threshold uncertainty score0.750

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.001
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.161
GPT teacher head0.281
Teacher spread0.121 · 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