MétaCan
Menu
Back to cohort
Record W2022255738 · doi:10.1109/ccece.2008.4564528

Verification of program dynamic behaviours based on static analysis

2008· article· en· W2022255738 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.
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
TopicSoftware Testing and Debugging Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceStatic analysisCoding (social sciences)Program analysisDynamic program analysisStatic program analysisSource codeDynamic programmingState (computer science)Code (set theory)Programming languageAlgorithmSoftwareSoftware development

Abstract

fetched live from OpenAlex

Verification of dynamic behaviours of a program is usually conducted by executing the program on the target platform under different test cases and observing the results. This paper investigates the use of static analysis to verify some aspects of dynamic behaviours including state transitions and sequences of interaction between program components. The paper describes an algorithm to extract a model of state transition directly from source code, regardless of the programming style; and the method of generating execution scenarios from the model to compare with use cases. Our experiments show that this static method is effective in detecting possible coding errors.

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 categoriesMeta-epidemiology (narrow)
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.947
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.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.020
GPT teacher head0.234
Teacher spread0.213 · 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