MétaCan
Menu
Back to cohort
Record W2109627209 · doi:10.1109/icdar.1995.601962

Analyzing the logical structure of data flow diagrams in software documents

2002· article· en· W2109627209 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
TopicFormal Methods in Verification
Canadian institutionsConcordia University
Fundersnot available
KeywordsDiagrammatic reasoningData flow diagramComputer scienceLogical data modelConcurrencyFormalism (music)Data structureTheoretical computer scienceNotationSoftwareProgramming languageFlowchartEquivalence (formal languages)Data modelingAlgorithmSoftware engineeringMathematicsDatabaseDiscrete mathematics

Abstract

fetched live from OpenAlex

Understanding software documents requires the logical structure analysis of diagrammatic notations, such as data flow diagrams. A data flow diagram (DFD) represents the functional dependencies within a system: it shows how output values in a computation are derived from input values. We show how the logical structure of a DFD can be described using the formalism of Calculus of Communicating Systems (CCS). We present the process of generating the logical structure, and show how the formalism is used for deep understanding of DFDs. Using the Edinburgh Concurrency Workbench (CWB), we can use the formal description of a DFD to reason about the equivalence of two DFDs, and to simulate the behavior of a DFD.

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.963
Threshold uncertainty score0.378

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.0020.001
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.084
GPT teacher head0.326
Teacher spread0.242 · 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

Quick stats

Citations12
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicFormal Methods in VerificationFrench-language works237,207